Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (Q1874418): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:50, 1 February 2024
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
25 May 2003
0 references
Graph partitioning
0 references
Polynomial algorithms
0 references
Clique-width
0 references
