scientific article; zbMATH DE number 1439485

MaRDI QIDQ4949864zbMATH OpenFDO

Authors Jie Wu

Publication date 13 June 2001

zbMATH Keywords

directed graphHamiltonian path

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Finding an Oriented Hamiltonian Path in a Tournament
• Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs
• A linear-time algorithm for finding Hamiltonian cycles in tournaments
• A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs

Cited in

(5)

• Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs
• The complexity of finding generalized paths in tournaments
• A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs
• Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments
• Finding an Oriented Hamiltonian Path in a Tournament

This page was built for publication:

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