Characterization of efficiently solvable problems on distance-hereditary graphs

DOI10.1007/3-540-49381-6_28MaRDI QIDQ4249531zbMATH OpenFDO

Authors Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen

Publication date 17 June 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-49381-6_28

zbMATH Keywords

distance-hereditary graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs
• scientific article; zbMATH DE number 815104
• scientific article; zbMATH DE number 2089962
• The Hamiltonian problem on distance-hereditary graphs

Cited in

(6)

• An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs
• Computing maximum stable sets for distance-hereditary graphs
• An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs
• Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs
• scientific article; zbMATH DE number 815104 (Why is no real title available?)
• Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs

This page was built for publication: Characterization of efficiently solvable problems on distance-hereditary graphs

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