Ranking the vertices of a complete multipartite paired comparison digraph

被引：0

作者：

机构：

来源：

Discrete Appl Math | / 1-2卷 / 75期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[1] Ranking the vertices of a complete multipartite paired comparison digraph
Gutin, G
Yeo, A
DISCRETE APPLIED MATHEMATICS, 1996, 69 (1-2) : 75 - 82
[2] RANKING THE VERTICES OF A PAIRED COMPARISON DIGRAPH
KANO, M
SAKAMOTO, A
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1985, 6 (01): : 79 - 92
[3] RANKING THE VERTICES OF COMPLETE MULTIPARTITE PAIRED-COMPARISON DIGRAPHS
GUTIN, GM
AUTOMATION AND REMOTE CONTROL, 1989, 50 (10) : 1421 - 1427
[4] RANKING THE VERTICES OF AN R-PARTITE PAIRED COMPARISON DIGRAPH
KANO, M
DISCRETE APPLIED MATHEMATICS, 1987, 17 (03) : 245 - 253
[5] FINDING A LONGEST PATH IN A COMPLETE MULTIPARTITE DIGRAPH
GUTIN, G
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1993, 6 (02) : 270 - 273
[6] RANKING THE VERTICES OF A WEIGHTED DIGRAPH USING THE LENGTH OF FORWARD ARCS
KANO, M
SAKAMOTO, A
NETWORKS, 1983, 13 (01) : 143 - 151
[7] A polynomial time algorithm for finding a cycle covering a given set of vertices in a semicomplete multipartite digraph
Yeo, A
JOURNAL OF ALGORITHMS, 1999, 33 (01) : 124 - 139
[8] On the spectral characterization of the union of complete multipartite graph and some isolated vertices
Ma, Haicheng
Ren, Haizhen
DISCRETE MATHEMATICS, 2010, 310 (24) : 3648 - 3652
[9] On the spectral characterization of the union of complete multipartite graph and some isolated vertices
Department of Mathematics, Qinghai Nationalities University, Xining, Qinghai, 810007, China
不详
Discrete Math, 24 (3648-3652):
[10] EXPERIMENTAL COMPARISON OF ALGORITHMS FOR THE PROBLEM OF THE MAXIMUM SET OF PAIRWISE INCOMPARABLE VERTICES IN A DIGRAPH
VOITISHIN, YV
CYBERNETICS AND SYSTEMS ANALYSIS, 1992, 28 (05) : 788 - 791

← 1 2 3 4 5 →