Vertex heaviest paths and cycles in quasi-transitive digraphs

DOI10.1016/0012-365X(95)00318-QzbMath0876.05058OpenAlexW1987668728MaRDI QIDQ1356546

Gregory Gutin, Jörgen Bang-Jensen

Publication date: 25 November 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00318-q

zbMATH Keywords

digraphHamiltonian cyclepolynomial algorithmsHamiltonian pathlongest pathlongest cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Paths and cycles in extended and decomposable digraphs ⋮ Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs ⋮ Linkages in locally semicomplete digraphs and quasi-transitive digraphs ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ Kings in quasi-transitive digraphs

Cites Work

• Finding a Longest Path in a Complete Multipartite Digraph
• Quasi‐transitive digraphs
• Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Vertex heaviest paths and cycles in quasi-transitive digraphs