A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs
From MaRDI portal
Publication:3990618
DOI10.1016/0196-6774(92)90008-ZzbMath0749.68057OpenAlexW2094567843MaRDI QIDQ3990618
Carsten Thomassen, Yannis Manoussakis, Jörgen Bang-Jensen
Publication date: 28 June 1992
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(92)90008-z
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
Antidirected Hamiltonian paths between specified vertices of a tournament ⋮ Cycles of all lengths in arc-3-cyclic semicomplete digraphs ⋮ Spanning eulerian subdigraphs in semicomplete digraphs ⋮ Good orientations of unions of edge‐disjoint spanning trees ⋮ Detours in directed graphs ⋮ NC algorithms for antidirected hamiltonian paths and cycles in tournaments ⋮ Quasi-hamiltonian paths in semicomplete multipartite digraphs ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Tournaments and Semicomplete Digraphs
This page was built for publication: A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs
