Using split composition to extend distance-hereditary graphs in a generative way (extended abstract)
From MaRDI portal
Publication:3010409
DOI10.1007/978-3-642-20877-5_29zbMATH Open1333.05284OpenAlexW1538699184MaRDI QIDQ3010409FDOQ3010409
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Structural characterization of families of graphs (05C75)
Cites Work
- Distance-hereditary graphs
- Decomposition of Directed Graphs
- Solving some NP-complete problems using split decomposition
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Recognizing circle graphs in polynomial time
- Graph classes between parity and distance-hereditary graphs
- Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
- Dynamic Distance Hereditary Graphs Using Split Decomposition
- Completely separable graphs
- A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
- On the extension of bipartite to parity graphs
- Clique-width of graphs defined by one-vertex extensions
- Graphs with bounded induced distance
- Title not available (Why is that?)
- Compact-port routing models and applications to distance-hereditary graphs
- Networks with small stretch number
- Using split composition to extend distance-hereditary graphs in a generative way (extended abstract)
Cited In (1)
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)
