DETERMINING OPTIMALLY ORDERED PAIRS USING EDGE-COLORING OF GRAPHS

Authors
CLOETE I CLOETE WG
Citation
I. Cloete et Wg. Cloete, DETERMINING OPTIMALLY ORDERED PAIRS USING EDGE-COLORING OF GRAPHS, IEEE transactions on systems, man, and cybernetics, 23(1), 1993, pp. 237-239
Citations number
4
Categorie Soggetti
Controlo Theory & Cybernetics","Computer Applications & Cybernetics
Journal title
IEEE transactions on systems, man, and cybernetics → ACNP
ISSN journal
00189472
Volume
23
Issue
1
Year of publication
1993
Pages
237 - 239
Database
ISI
SICI code
0018-9472(1993)23:1<237:DOOPUE>2.0.ZU;2-Q
Abstract
Tables to find optimally ordered pairs for the assessment of judgement al 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 algor ithm for constructing orders by hand without consulting tables.