Pages that link to "Item:Q1878696"

The following pages link to Parallel algorithms for Hamiltonian problems on quasi-threshold graphs (Q1878696):

Displaying 12 items.

• A lower bound on the Hamiltonian path completion number of a line graph (Q902504) (← links)
• NP-completeness results for some problems on subclasses of bipartite and chordal graphs (Q995581) (← links)
• A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (Q1024477) (← links)
• Partitioning graphs into Hamiltonian ones (Q1352030) (← links)
• Quasi-threshold graphs (Q1923584) (← links)
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
• Evolutionary operators for the Hamiltonian completion problem (Q2156924) (← links)
• A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)
• Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757) (← links)
• The Hamiltonian problem on distance-hereditary graphs (Q2489947) (← links)
• The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs (Q3507334) (← links)
• (Q5708515) (← links)