By Topic

Determining optimally ordered pairs using edge-coloring of graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cloete, I. ; Dept. of Comput. Sci., Stellenbosch Univ., South Africa ; Cloete, W.G.

Tables to find optimally ordered pairs for the assessment of judgemental information were published. The optimality of such orders according to spacing and balance requirements is proved using edge-colorings of graphs. In addition, the constructive proof leads to an elegant algorithm for constructing orders by hand without consulting tables

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:23 ,  Issue: 1 )