|
Avtomatika i Telemekhanika, 1989, Issue 10, Pages 139–147
(Mi at6449)
|
|
|
|
Simulation of Behavior and Intelligence
Determining the ranks of vertices in complete multipartite graphs of pairwise comparisons
G. M. Gutin Minsk
Abstract:
The ranking is discussed of vertices in a complete multipartite digraph of pairwise comparisons, optimal in the Kano — Sakamoto sense. A formula and linear (in terms of the number of arcs) algorithm for determing the vertex ranks are obtained.
Received: 07.06.1988
Citation:
G. M. Gutin, “Determining the ranks of vertices in complete multipartite graphs of pairwise comparisons”, Avtomat. i Telemekh., 1989, no. 10, 139–147; Autom. Remote Control, 50:10 (1989), 1421–1427
Linking options:
https://www.mathnet.ru/eng/at6449 https://www.mathnet.ru/eng/at/y1989/i10/p139
|
Statistics & downloads: |
Abstract page: | 93 | Full-text PDF : | 35 | First page: | 2 |
|