Parallel algorithms for Hamiltonian problems on quasi-threshold graphs

DOI10.1016/J.JPDC.2003.08.004MaRDI QIDQ1878696zbMATH OpenOpenAlexFDO

Authors Stavros D. Nikolopoulos

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

zbMATH Keywords

Hamiltonian cycleQT-graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 4179413
• The Hamiltonian problem on distance-hereditary graphs
• Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs
• PARALLEL RECOGNITION ALGORITHMS FOR GRAPHS WITH RESTRICTED NEIGHBOURHOODS
• A fast parallel algorithm for finding Hamiltonian cycles in dense graphs

Cited in

(12)

• A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
• Partitioning graphs into Hamiltonian ones
• Quasi-threshold graphs
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
• Evolutionary operators for the Hamiltonian completion problem
• A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs
• Local search algorithms for finding the Hamiltonian completion number of line graphs
• The Hamiltonian problem on distance-hereditary graphs
• The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs
• scientific article; zbMATH DE number 2230224 (Why is no real title available?)
• A lower bound on the Hamiltonian path completion number of a line graph
• NP-completeness results for some problems on subclasses of bipartite and chordal graphs

This page was built for publication: Parallel algorithms for Hamiltonian problems on quasi-threshold graphs

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