MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5161898
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | MSOL partitioning problems on graphs of bounded treewidth and clique-width |
scientific article; zbMATH DE number 5161898 |
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
0 references
0 references
0.8438355922698975
0 references
0.8425273895263672
0 references
0.8176885843276978
0 references
0.8175225853919983
0 references
