Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
From MaRDI portal
(Redirected from Publication:415271)
Recommendations
- Dynamic Distance Hereditary Graphs Using Split Decomposition
- Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs
- Practical and efficient split decomposition via graph-labelled trees
- A completely dynamic algorithm for split graphs
- An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs
Cites work
- scientific article; zbMATH DE number 3906240 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1305520 (Why is no real title available?)
- scientific article; zbMATH DE number 1512682 (Why is no real title available?)
- A Combinatorial Decomposition Theory
- A Fully dynamic algorithm for recognizing and representing proper interval graphs
- A Linear Recognition Algorithm for Cographs
- A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs
- A fully dynamic algorithm for modular decomposition and recognition of cographs.
- A note on computing set overlap classes
- A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs
- A survey of the algorithmic aspects of modular decomposition
- An O(n2) Algorithm for Undirected Split Decomposition
- An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs
- Completely separable graphs
- Decomposition of Directed Graphs
- Decomposition of perfect graphs
- Distance labeling scheme and split decomposition
- Distance-hereditary graphs
- Dynamic Distance Hereditary Graphs Using Split Decomposition
- Efficient graph representations
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
- Fully dynamic recognition algorithm and certificate for directed cographs
- Graph Classes: A Survey
- Graph Drawing
- Graph classes between parity and distance-hereditary graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Graphs indecomposable with respect to the X-join
- On graph powers for leaf-labeled trees
- On-line maintenance of triconnected components with SPQR-trees
- Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
- Rank-width and vertex-minors
- Reducing prime graphs and recognizing circle graphs
- Structure and linear time recognition of 3-leaf powers
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The monadic second-order logic of graphs XVI : Canonical graph decompositions
- Topics in Intersection Graph Theory
- Transitiv orientierbare Graphen
Cited in
(27)- On strict (outer-)confluent graphs
- A polynomial kernel for distance-hereditary vertex deletion
- Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs
- Practical and efficient split decomposition via graph-labelled trees
- On strict (outer-)confluent graphs
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- Topology and counting of real algebraic curves
- Dynamic Distance Hereditary Graphs Using Split Decomposition
- A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
- Dynamically maintaining split graphs
- Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes
- Enumerations, forbidden subgraph characterizations, and the split-decomposition
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats
- Grammars and clique-width bounds from split decompositions
- Modular decomposition of graphs and the distance preserving property
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion
- Solving problems on graphs of high rank-width
- \(O(m\log n)\) split decomposition of strongly-connected graphs
- Hypergraphs with polynomial representation: introducing \(r\)-splits
- The Structure of Level-k Phylogenetic Networks
- An exact enumeration of distance-hereditary graphs
- Split-decomposition trees with prime nodes: enumeration and random generation of cactus graphs
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Practical and efficient circle graph recognition
- Solving problems on graphs of high rank-width
- Distance-hereditary comparability graphs
This page was built for publication: Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415271)
