A linear-time algorithm for finding Hamiltonian cycles in tournaments

DOI10.1016/0166-218X(92)90233-ZzbMath0776.05095MaRDI QIDQ1192953

Yannis Manoussakis

Publication date: 27 September 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian cycletournamentHamilton pathlinear-time algorithm

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs ⋮ A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian ⋮ Sparse Spanning $k$-Connected Subgraphs in Tournaments ⋮ Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter ⋮ Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs

Cites Work

• The complexity of finding generalized paths in tournaments
• Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament
• Unnamed Item
• Unnamed Item

This page was built for publication: A linear-time algorithm for finding Hamiltonian cycles in tournaments