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

From MaRDI portal
Revision as of 13:21, 7 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56475002, #quickstatements; #temporary_batch_1707303357582)
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

    Identifiers

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