Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334)

From MaRDI portal
Revision as of 02:57, 8 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
Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs
scientific article

    Statements

    Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (English)
    0 references
    0 references
    25 May 2010
    0 references
    0 references
    split graphs
    0 references
    minimum fill-in
    0 references
    treewidth
    0 references
    parameterized algorithms
    0 references