An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs

DOI10.1006/jagm.1995.1007zbMath0818.68087OpenAlexW1972912707MaRDI QIDQ4327819

Balaji Raghavachari, Martin Fuerer

Publication date: 20 August 1995

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

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

zbMATH Keywords

Hamiltonian cycleCREW PRAM

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

This page was built for publication: An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs