MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.03.043 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008361472 / rank | |||
Normal rank | |||
Revision as of 01:39, 20 March 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
