Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament

DOI10.1016/0196-6774(88)90042-9zbMath0644.05036OpenAlexW2066708286MaRDI QIDQ3786504

Danny Soroker

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

zbMATH Keywords

directed graphHamiltonian cycleparallel algorithmtournamentHamiltonian pathstrongly connected components

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Related Items (10)

Antidirected Hamiltonian paths between specified vertices of a tournament ⋮ Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs ⋮ The watchman's walk problem on directed graphs ⋮ Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey ⋮ NC algorithms for antidirected hamiltonian paths and cycles in tournaments ⋮ ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES ⋮ The Hamilton circuit problem on grids ⋮ A linear-time algorithm for finding Hamiltonian cycles in tournaments ⋮ A fast parallel algorithm for finding Hamiltonian cycles in dense graphs ⋮ Finding the maximum multi improvement on neighborhood exploration

This page was built for publication: Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament