A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs

DOI10.1016/0196-6774(92)90008-ZzbMath0749.68057MaRDI QIDQ3990618

Carsten Thomassen, Yannis Manoussakis, Jörgen Bang-Jensen

Publication date: 28 June 1992

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

zbMATH Keywords

polynomial algorithm; Hamiltonian path

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Cycles of all lengths in arc-3-cyclic semicomplete digraphs