Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
type: Item
instance of: scholarly article
title: Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
zbMATH Open document ID: 1236.05162
author: Emeric Gioan
author: Christophe Paul
published in: Discrete Applied Mathematics
publication date: 2012-05-11T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 6033757
zbMATH Keywords: split decomposition
zbMATH Keywords: distance hereditary graphs
zbMATH Keywords: fully dynamic algorithms
Wikidata QID: Q56475002
MaRDI profile type: Publication
full work available at URL: j.dam.2011.05.007
OpenAlex ID: W2105085476
cites work: Q4091421
cites work: Structure and linear time recognition of 3-leaf powers
cites work: Graph Classes: A Survey
cites work: Distance-hereditary graphs
cites work: Reducing prime graphs and recognizing circle graphs
cites work: Graph classes between parity and distance-hereditary graphs
cites work: Decomposition of Directed Graphs
cites work: A Combinatorial Decomposition Theory
cites work: Q4508369
cites work: A note on computing set overlap classes
cites work: A Linear Recognition Algorithm for Cographs
cites work: The monadic second-order logic of graphs XVI : Canonical graph decompositions
cites work: Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
cites work: Fully dynamic recognition algorithm and certificate for directed cographs
cites work: Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
cites work: A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs
cites work: On-line maintenance of triconnected components with SPQR-trees
cites work: Graph Drawing
cites work: Transitiv orientierbare Graphen
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: Distance labeling scheme and split decomposition
cites work: Dynamic Distance Hereditary Graphs Using Split Decomposition
cites work: Completely separable graphs
cites work: A Fully dynamic algorithm for recognizing and representing proper interval graphs
cites work: A survey of the algorithmic aspects of modular decomposition
cites work: Decomposition of perfect graphs
cites work: Q4252412
cites work: Topics in Intersection Graph Theory
cites work: Q3683903
cites work: An O(n2) Algorithm for Undirected Split Decomposition
cites work: A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs
cites work: On graph powers for leaf-labeled trees
cites work: Rank-width and vertex-minors
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: A fully dynamic algorithm for modular decomposition and recognition of cographs.
cites work: Efficient graph representations
cites work: Graphs indecomposable with respect to the X-join
cites work: An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs
DOI: 10.1016/J.DAM.2011.05.007
DBLP publication ID: journals/dam/GioanP12
description: scientific article; zbMATH DE number 6033757