An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs
From MaRDI portal
Publication:1881305
DOI10.1016/j.jpdc.2004.03.014zbMath1106.68084OpenAlexW2027029476MaRDI QIDQ1881305
Publication date: 4 October 2004
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2004.03.014
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Related Items (5)
The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs ⋮ Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs ⋮ The 1-fixed-endpoint path cover problem is Polynomial on interval graphs ⋮ A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs ⋮ Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
This page was built for publication: An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs
