A linear-time algorithm for finding Hamiltonian cycles in tournaments
From MaRDI portal
Publication:1192953
DOI10.1016/0166-218X(92)90233-ZzbMath0776.05095MaRDI QIDQ1192953
Publication date: 27 September 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
05C38: Paths and cycles
05C85: Graph algorithms (graph-theoretic aspects)
05C20: Directed graphs (digraphs), tournaments
05C45: Eulerian and Hamiltonian graphs
Related Items
Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs, A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian, Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs
Cites Work