A linear time algorithm for finding tree-decompositions of small treewidth (Q5248490)

From MaRDI portal
Revision as of 05:26, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): conf/stoc/Bodlaender93, #quickstatements; #temporary_batch_1731468600454)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6434234
Language Label Description Also known as
English
A linear time algorithm for finding tree-decompositions of small treewidth
scientific article; zbMATH DE number 6434234

    Statements

    A linear time algorithm for finding tree-decompositions of small treewidth (English)
    0 references
    7 May 2015
    0 references
    graph algorithms
    0 references
    graph minors
    0 references
    pathwidth
    0 references
    treewidth
    0 references
    0 references

    Identifiers

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