Fast parallel algorithms for finding Hamiltonian paths and cycles in a tournament
Book
·
OSTI ID:5384589
A tournament is a digraph T = (V,E) in which, for every pair of vertices, ..mu.. an ..nu.., exactly one of (..mu..,..nu..), (..nu..,..mu..) is in E. Two classical theorems about tournaments are that every tournament has a Hamiltonian path and that every strongly connected tournament has a Hamiltonian cycle. Furthermore, it is known how to find these in polynomial time. In this paper the authors discuss the parallel complexity of these problems. Their main result is that constructing a Hamiltonian path in a general tournament and a Hamiltonian cycle in a strongly connected tournament are both in NC. In addition, they give an NC algorithm for finding a Hamiltonain path with one fixed endpoint.
- OSTI ID:
- 5384589
- Country of Publication:
- United States
- Language:
- English
Similar Records
Fast parallel algorithms for graphs and networks
Optimal parallel construction of prescribed tournaments
An efficient algorithm for the vertex-disjoint paths problem in random graphs
Thesis/Dissertation
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:5575747
Optimal parallel construction of prescribed tournaments
Book
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:6837564
An efficient algorithm for the vertex-disjoint paths problem in random graphs
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:416808