Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition (Q3046514)

From MaRDI portal
Revision as of 20:07, 29 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
scientific article

    Statements

    Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition (English)
    0 references
    0 references
    0 references
    12 August 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    Algorithms and data structures
    0 references
    graph algorithms
    0 references
    treewidth
    0 references
    minimum fill-in
    0 references
    modular decomposition
    0 references
    minimal separators
    0 references