FAST PARALLEL ALGORITHMS FOR FINDING HAMILTONIAN PATHS AND CYCLES IN A TOURNAMENT

被引：15

作者：

SOROKER, D ^{[1
]}

机构：

[1] UNIV CALIF BERKELEY,DIV COMP SCI,BERKELEY,CA 94720

来源：

JOURNAL OF ALGORITHMS | 1988年 / 9卷 / 02期

关键词：

D O I：

10.1016/0196-6774(88)90042-9

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：276 / 286

页数：11

共 50 条

[1] FAST ALGORITHMS FOR FINDING HAMILTONIAN PATHS AND CYCLES IN IN-TOURNAMENT DIGRAPHS
BANGJENSEN, J
HELL, P
[J]. DISCRETE APPLIED MATHEMATICS, 1993, 41 (01) : 75 - 79
[2] Parallel algorithms for finding a Hamiltonian path and a Hamiltonian cycle in an in-tournament graph
Nakayama, S
Masuyama, S
[J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1998, E81A (05): : 757 - 767
[3] A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
Sarkozy, Gabor N.
[J]. DISCRETE MATHEMATICS, 2009, 309 (06) : 1611 - 1622
[4] Fast parallel algorithms for finding the longest flow paths in flow direction grids
Kotyra, Bartlomiej
Chabudzinski, Lukasz
[J]. ENVIRONMENTAL MODELLING & SOFTWARE, 2023, 167
[5] On the number of Hamiltonian cycles in a tournament
Friedgut, E
Kahn, J
[J]. COMBINATORICS PROBABILITY & COMPUTING, 2005, 14 (5-6): : 769 - 781
[6] On Hamiltonian cycles and Hamiltonian paths
Rahman, MS
Kaykobad, M
[J]. INFORMATION PROCESSING LETTERS, 2005, 94 (01) : 37 - 41
[7] POLYNOMIAL ALGORITHMS FOR FINDING CYCLES AND PATHS IN BIPARTITE TOURNAMENTS
MANOUSSAKIS, Y
TUZA, Z
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1990, 3 (04) : 537 - 543
[8] Finding an oriented Hamiltonian path in a tournament
Havet, F
[J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2000, 36 (02): : 253 - 275
[9] Finding Hamiltonian cycles
Altschuler, EL
Lades, M
Stong, R
[J]. SCIENCE, 1996, 273 (5274) : 413 - 414
[10] PARALLEL ALGORITHMS FOR FINDING HAMILTON CYCLES IN RANDOM GRAPHS
FRIEZE, AM
[J]. INFORMATION PROCESSING LETTERS, 1987, 25 (02) : 111 - 117

← 1 2 3 4 5 →