MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:50, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | MSOL partitioning problems on graphs of bounded treewidth and clique-width |
scientific article |
Statements
MSOL partitioning problems on graphs of bounded treewidth and clique-width (English)
0 references
6 June 2007
0 references
graph algorithms
0 references
monadic second-order logic
0 references
vertex partitioning
0 references
clique-width
0 references
treewidth
0 references
