Deciding Clique-Width for Graphs of Bounded Tree-Width (Q4435348): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:37, 7 February 2024
scientific article; zbMATH DE number 2010590
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding Clique-Width for Graphs of Bounded Tree-Width |
scientific article; zbMATH DE number 2010590 |
Statements
Deciding Clique-Width for Graphs of Bounded Tree-Width (English)
0 references
30 November 2003
0 references
linear time algorithm
0 references
