Finding an Oriented Hamiltonian Path in a Tournament

DOI10.1006/JAGM.2000.1085zbMATH Open0958.68193OpenAlexW2052357446MaRDI QIDQ4500855FDOQ4500855

Authors: Frédéric Havet 

Publication date: 27 August 2000

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c69eece88ecf2af6056820a7da9422630e3f3366

Recommendations

• Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs
• scientific article; zbMATH DE number 1439485
• Antidirected Hamiltonian paths between specified vertices of a tournament
• A linear-time algorithm for finding Hamiltonian cycles in tournaments

zbMATH Keywords

tournamentoriented path

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cited In (7)

• Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament
• Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
• Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
• A linear-time algorithm for finding Hamiltonian cycles in tournaments
• Antidirected Hamiltonian paths between specified vertices of a tournament
• Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs
• Construction of Hamilton path tournament designs

This page was built for publication: Finding an Oriented Hamiltonian Path in a Tournament

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500855)