Deciding Clique-Width for Graphs of Bounded Tree-Width (Q4435348)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Deciding Clique-Width for Graphs of Bounded Tree-Width |
scientific article; zbMATH DE number 2010590
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.92724556
0 references
0.91961706
0 references
0.9196088
0 references
0.9196088
0 references
0.9191447
0 references
0.9148536
0 references
0.91363263
0 references
