×

zbMATH — the first resource for mathematics

Ranking the vertices of complete multipartite paired-comparison digraphs. (English. Russian original) Zbl 0713.05033
Autom. Remote Control 50, No. 10, 1421-1427 (1989); translation from Avtom. Telemekh. 1989, No. 10, 139-147 (1989).
Summary: A ranking, optimal in the sense of M. Kano and A. Sakamoto [SIAM J. Algebraic Discrete Methods 6, 79-92 (1985; Zbl 0572.05030)] of the vertices of a complete multipartite digraph of paired comparisons is discussed. An equation and a linear (in the arc number) algorithm are obtained for determining the ranks of the vertices.
MSC:
05C20 Directed graphs (digraphs), tournaments
05C85 Graph algorithms (graph-theoretic aspects)
PDF BibTeX XML Cite