Computing the treewidth and the minimum fill-in with the modular decomposition (Q1402225)

From MaRDI portal
Revision as of 15:33, 20 July 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
    0 references
    19 August 2003
    0 references
    Treewidth
    0 references
    Minimum fill-in
    0 references
    Modular decomposition
    0 references
    Minimal separators
    0 references
    Polynomial algorithms
    0 references
    Graph algorithms
    0 references

    Identifiers