Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (Q1874418)

From MaRDI portal
Revision as of 15:54, 5 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
scientific article

    Statements

    Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (English)
    0 references
    0 references
    0 references
    25 May 2003
    0 references
    Graph partitioning
    0 references
    Polynomial algorithms
    0 references
    Clique-width
    0 references

    Identifiers