Exact Algorithms for Treewidth and Minimum Fill-In (Q3631902)

From MaRDI portal
Revision as of 02:08, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Exact Algorithms for Treewidth and Minimum Fill-In
scientific article

    Statements

    Exact Algorithms for Treewidth and Minimum Fill-In (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 June 2009
    0 references
    exact exponential algorithm
    0 references
    treewidth
    0 references
    fill-in
    0 references
    minimal separators
    0 references
    potential maximal clique
    0 references
    minimal triangulation
    0 references

    Identifiers

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