A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments

DOI10.1006/JAGM.1995.1045zbMATH Open0836.68051OpenAlexW2006803815MaRDI QIDQ4857540FDOQ4857540

Authors:

Publication date: 11 April 1996

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

Full work available at URL: https://doi.org/10.1006/jagm.1995.1045

Recommendations

• Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament
• Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs
• On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs
• A linear-time algorithm for finding Hamiltonian cycles in tournaments
• An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs

zbMATH Keywords

Hamiltonian cyclestournamentsHamiltonian paths

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Distributed algorithms (68W15)

Cited In (7)

• Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament
• Optimal parallel construction of prescribed tournaments
• Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs
• An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs
• Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments
• NC algorithms for antidirected hamiltonian paths and cycles in tournaments
• On the parallel complexity of the alternating Hamiltonian cycle problem

This page was built for publication: A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857540)