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

From MaRDI portal
Revision as of 02:55, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    0 references