Dynamic Distance Hereditary Graphs Using Split Decomposition

DOI10.1007/978-3-540-77120-3_6zbMath1193.68191OpenAlexW1520885470MaRDI QIDQ5387744

Emeric Gioan, Christophe Paul

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_6

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)

Related Items (10)

Solving Problems on Graphs of High Rank-Width ⋮ The axiomatic characterization of the interval function of distance hereditary graphs ⋮ Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs ⋮ A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs ⋮ Solving problems on graphs of high rank-width ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ Practical and efficient circle graph recognition ⋮ Practical and efficient split decomposition via graph-labelled trees ⋮ Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way ⋮ Distance-hereditary comparability graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completely separable graphs
• Distance-hereditary graphs
• A fully dynamic algorithm for modular decomposition and recognition of cographs.
• Rank-width and vertex-minors
• A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
• A Linear Recognition Algorithm for Cographs
• Decomposition of Directed Graphs
• Topics in Intersection Graph Theory
• Recognition of Circle Graphs
• Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
• On-Line Planarity Testing
• Separator based sparsification for dynamic planar graph algorithms
• Transitiv orientierbare Graphen
• Graph-Theoretic Concepts in Computer Science
• Graph-Theoretic Concepts in Computer Science
• Graph Drawing
• A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs

This page was built for publication: Dynamic Distance Hereditary Graphs Using Split Decomposition