Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament
From MaRDI portal
Publication:3786504
DOI10.1016/0196-6774(88)90042-9zbMath0644.05036MaRDI QIDQ3786504
Publication date: 1988
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(88)90042-9
directed graph; Hamiltonian cycle; parallel algorithm; tournament; Hamiltonian path; strongly connected components
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C45: Eulerian and Hamiltonian graphs
Related Items
The Hamilton circuit problem on grids, Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey, ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES, A fast parallel algorithm for finding Hamiltonian cycles in dense graphs, Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs, A linear-time algorithm for finding Hamiltonian cycles in tournaments, Antidirected Hamiltonian paths between specified vertices of a tournament