A linear-time algorithm for finding Hamiltonian cycles in tournaments (Q1192953)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 61825
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear-time algorithm for finding Hamiltonian cycles in tournaments |
scientific article; zbMATH DE number 61825 |
Statements
A linear-time algorithm for finding Hamiltonian cycles in tournaments (English)
0 references
27 September 1992
0 references
The author presents an elegant algorithm for transforming a Hamilton path in an \(n\)-node tournament into a Hamiltonian cycle or into its strongly connected components, if there is no Hamiltonian cycle. Combined with a known \(O(n\log n)\) algorithm for determining a Hamiltonian path, it yields an algorithm runing in linear time with respect to the number \(m=n(n-1)/2\) of arcs which is an improvement of \(O(\log n)\) over the previously best known algorithm.
0 references
linear-time algorithm
0 references
Hamilton path
0 references
tournament
0 references
Hamiltonian cycle
0 references
0.8631438612937927
0 references
0.8541930913925171
0 references
0.8318446278572083
0 references
0.8276624083518982
0 references
0.8261051774024963
0 references
