Finding an oriented Hamiltonian path in a tournament

被引：1

作者：

Havet, F ^{[1
]}

机构：

[1] Univ Lyon 1, UFR Math, Lab LMD, F-69622 Villeurbanne, France

来源：

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC | 2000年 / 36卷 / 02期

关键词：

D O I：

10.1006/jagm.2000.1085

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We present an O(n(2)) algorithm for finding a specified oriented path of order at least n in a tournament of order II. Using this algorithm, we present an O(n(2)) algorithm that finds a specified oriented path from a given Vertex if one exists. (C) 2000 Academic Press.

引用

页码：253 / 275

页数：23

共 50 条

[1] 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
[2] FAST PARALLEL ALGORITHMS FOR FINDING HAMILTONIAN PATHS AND CYCLES IN A TOURNAMENT
SOROKER, D
[J]. JOURNAL OF ALGORITHMS, 1988, 9 (02) : 276 - 286
[3] 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
[4] An approximation algorithm for finding a long path in Hamiltonian graphs
Vishwanathan, S
[J]. PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 680 - 685
[5] Finding a shortest Hamiltonian path inside a simple polygon
Alsuwaiyel, MH
[J]. INFORMATION PROCESSING LETTERS, 1996, 59 (04) : 207 - 210
[6] On the number of Hamiltonian cycles in a tournament
Friedgut, E
Kahn, J
[J]. COMBINATORICS PROBABILITY & COMPUTING, 2005, 14 (5-6): : 769 - 781
[7] ON THE STRONG PATH CONNECTIVITY OF A TOURNAMENT
朱永津
田丰
[J]. Science China Mathematics, 1979, (S1) : 18 - 28
[8] HAMILTON PATH TOURNAMENT DESIGNS
HORTON, JD
[J]. ARS COMBINATORIA, 1989, 27 : 69 - 74
[9] ON THE STRONG PATH CONNECTIVITY OF A TOURNAMENT
朱永津
田丰
[J]. Science in China,Ser.A., 1979, Ser.A.1979(S1) (S1) - 28
[10] Transformation of task to locate a minimal Hamiltonian circuit into the problem of finding the Eulerian path
Kozel, Petr
Friedrich, Vaclav
Michalcova, Sarka
[J]. MATHEMATICAL METHODS IN ECONOMICS (MME 2017), 2017, : 360 - 365

← 1 2 3 4 5 →