Using split composition to extend distance-hereditary graphs in a generative way (extended abstract)

DOI10.1007/978-3-642-20877-5_29MaRDI QIDQ3010409zbMATH OpenOpenAlexFDO

Authors Serafino Cicerone

Publication date 1 July 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-20877-5_29

zbMATH Keywords

distance-hereditary graphsgraph algorithmsrecognition problemsplit decompositionstretch number

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs
• Distance-hereditary comparability graphs
• Distance-hereditary comparability graphs
• Dynamic Distance Hereditary Graphs Using Split Decomposition
• Graph classes between parity and distance-hereditary graphs

Cites work

• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
• Clique-width of graphs defined by one-vertex extensions
• Compact-port routing models and applications to distance-hereditary graphs
• Completely separable graphs
• Decomposition of Directed Graphs
• Distance-hereditary graphs
• Dynamic Distance Hereditary Graphs Using Split Decomposition
• Graph classes between parity and distance-hereditary graphs
• Graphs with bounded induced distance
• scientific article; zbMATH DE number 205350 (Why is no real title available?)
• Networks with small stretch number
• On the extension of bipartite to parity graphs
• Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
• Recognizing circle graphs in polynomial time
• Solving some NP-complete problems using split decomposition
• Using split composition to extend distance-hereditary graphs in a generative way (extended abstract)

Cited in

(2)

• Graph classes between parity and distance-hereditary graphs
• Using split composition to extend distance-hereditary graphs in a generative way (extended abstract)

This page was built for publication: Using split composition to extend distance-hereditary graphs in a generative way (extended abstract)

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