Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (Q1874418)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for vertex-partitioning problems on graphs with fixed clique-width. |
scientific article; zbMATH DE number 1915592
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for vertex-partitioning problems on graphs with fixed clique-width. |
scientific article; zbMATH DE number 1915592 |
Statements
Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (English)
0 references
25 May 2003
0 references
Graph partitioning
0 references
Polynomial algorithms
0 references
Clique-width
0 references
0 references
0 references
