|
Avtomat. i Telemekh., 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.
Full text:
PDF file (998 kB)
English version:
Automation and Remote Control, 1989, 50:10, 1421–1427
Bibliographic databases:
UDC:
519.1:519.8
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
Citation in format AMSBIB
\Bibitem{Gut89}
\by G.~M.~Gutin
\paper Determining the ranks of vertices in complete multipartite graphs of pairwise comparisons
\jour Avtomat. i Telemekh.
\yr 1989
\issue 10
\pages 139--147
\mathnet{http://mi.mathnet.ru/at6449}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1026545}
\zmath{https://zbmath.org/?q=an:0713.05033}
\transl
\jour Autom. Remote Control
\yr 1989
\vol 50
\issue 10
\pages 1421--1427
Linking options:
http://mi.mathnet.ru/eng/at6449 http://mi.mathnet.ru/eng/at/y1989/i10/p139
Citing articles on Google Scholar:
Russian citations,
English citations
Related articles on Google Scholar:
Russian articles,
English articles
|
Number of views: |
This page: | 65 | Full text: | 27 | First page: | 2 |
|