Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q56475002 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2011.05.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2105085476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and linear time recognition of 3-leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing prime graphs and recognizing circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph classes between parity and distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Decomposition Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on computing set overlap classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs XVI : Canonical graph decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully dynamic algorithm for recognition and modular decomposition of permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully dynamic recognition algorithm and certificate for directed cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line maintenance of triconnected components with SPQR-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance labeling scheme and split decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Distance Hereditary Graphs Using Split Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely separable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the algorithmic aspects of modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n2) Algorithm for Undirected Split Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graph Powers for Leaf-Labeled Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and vertex-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully dynamic algorithm for modular decomposition and recognition of cographs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs indecomposable with respect to the X-join / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs / rank
 
Normal rank

Latest revision as of 05:22, 5 July 2024

scientific article
Language Label Description Also known as
English
Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
scientific article

    Statements

    Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (English)
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    split decomposition
    0 references
    distance hereditary graphs
    0 references
    fully dynamic algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references