Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament

DOI10.1007/3-540-61576-8_75MaRDI QIDQ6567672zbMATHFDO

Authors Evripidis Bampis, Pavol Hell, Y. Manoussakis, Moshe Rosenfeld

Publication date 5 July 2024

zbMATH Keywords

sequential and parallel algorithmsbackward \(x\)-antidirected Hamiltonian path

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Nonnumerical algorithms (68W05) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Antidirected Hamiltonian paths between specified vertices of a tournament
• NC algorithms for antidirected hamiltonian paths and cycles in tournaments
• Finding an Oriented Hamiltonian Path in a Tournament
• Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs
• Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament

Cites work

• scientific article; zbMATH DE number 3855147 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• Antidirected Hamilton circuits and paths in tournaments
• Antidirected Hamiltonian circuits in tournaments
• Antidirected Hamiltonian paths in tournaments
• Antidirected Hamiltonian paths in tournaments
• NC algorithms for antidirected hamiltonian paths and cycles in tournaments
• The complexity of finding generalized paths in tournaments

This page was built for publication: Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament

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