RANKING THE VERTICES OF A PAIRED COMPARISON DIGRAPH

被引：14

|

作者：

KANO, M ^{[1
]}

SAKAMOTO, A ^{[1
]}

机构：

[1] UNIV TOKUSHIMA,DEPT ENGN,TOKUSHIMA 770,JAPAN

来源：

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS | 1985年 / 6卷 / 01期

关键词：

D O I：

10.1137/0606009

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

收藏

页码：79 / 92

页数：14

相关论文

共 50 条

[1] Ranking the vertices of a complete multipartite paired comparison digraph
Gutin, G
Yeo, A
[J]. DISCRETE APPLIED MATHEMATICS, 1996, 69 (1-2) : 75 - 82
[2] RANKING THE VERTICES OF AN R-PARTITE PAIRED COMPARISON DIGRAPH
KANO, M
[J]. DISCRETE APPLIED MATHEMATICS, 1987, 17 (03) : 245 - 253
[3] RANKING THE VERTICES OF COMPLETE MULTIPARTITE PAIRED-COMPARISON DIGRAPHS
GUTIN, GM
[J]. AUTOMATION AND REMOTE CONTROL, 1989, 50 (10) : 1421 - 1427
[4] RANKING THE VERTICES OF A WEIGHTED DIGRAPH USING THE LENGTH OF FORWARD ARCS
KANO, M
SAKAMOTO, A
[J]. NETWORKS, 1983, 13 (01) : 143 - 151
[5] EXPERIMENTAL COMPARISON OF ALGORITHMS FOR THE PROBLEM OF THE MAXIMUM SET OF PAIRWISE INCOMPARABLE VERTICES IN A DIGRAPH
VOITISHIN, YV
[J]. CYBERNETICS AND SYSTEMS ANALYSIS, 1992, 28 (05) : 788 - 791
[6] On the Cayley Isomorphism Problem for a Digraph with 24 Vertices
Spiga, Pablo
[J]. ARS MATHEMATICA CONTEMPORANEA, 2008, 1 (01) : 38 - 43
[7] COVERING THE VERTICES OF A DIGRAPH BY CYCLES OF PRESCRIBED LENGTH
AMAR, D
RASPAUD, A
[J]. DISCRETE MATHEMATICS, 1991, 87 (02) : 111 - 118
[8] A computationally intensive ranking system for paired comparison data
Beaudoin, David
Swartz, Tim
[J]. OPERATIONS RESEARCH PERSPECTIVES, 2018, 5 : 105 - 112
[9] MAXIMUM LIKELIHOOD PAIRED COMPARISON RANKING BY LINEAR PROGRAMMING
DECANI, JS
[J]. BIOMETRIKA, 1969, 56 (03) : 537 - &
[10] RANKING FROM UNBALANCED PAIRED-COMPARISON DATA
DAVID, HA
[J]. BIOMETRIKA, 1987, 74 (02) : 432 - 436

← 1 2 3 4 5 →