Parallel algorithms for Hamiltonian problems on quasi-threshold graphs
From MaRDI portal
Publication:1878696
DOI10.1016/j.jpdc.2003.08.004zbMath1072.68124OpenAlexW1976448277MaRDI QIDQ1878696
Publication date: 8 September 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.2003.08.004
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items (9)
Evolutionary operators for the Hamiltonian completion problem ⋮ The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs ⋮ A lower bound on the Hamiltonian path completion number of a line graph ⋮ The 1-fixed-endpoint path cover problem is Polynomial on interval graphs ⋮ Local search algorithms for finding the Hamiltonian completion number of line graphs ⋮ The Hamiltonian problem on distance-hereditary graphs ⋮ A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs ⋮ NP-completeness results for some problems on subclasses of bipartite and chordal graphs ⋮ Unnamed Item
This page was built for publication: Parallel algorithms for Hamiltonian problems on quasi-threshold graphs
