Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs

2002/01/01 by Sun‐Yuan Hsieh, Sun-yuan Hsieh, Chin-wen Ho +5 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Binary logarithm #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Graph #Hamiltonian path #Mathematics #Optimization and Search Problems #Parallel algorithm #Running time #Time complexity #Tree (set theory)

paper · doi:10.1007/3-540-45655-4_10

crossref issued 2002/01/01 · crossref published 2002/01/01 · crossref published-print 2002/01/01 · openalex publication_date 2002/01/01 · crossref published-online 2002/08/29 · crossref created 2007/05/21 · crossref deposited 2019/02/16 · crossref indexed 2024/09/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Citations

• Completely separable graphs
• Distance-hereditary graphs
• Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width
• Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs

Cited by

• Distance-hereditary graph [wikipedia]