Deciding Clique-Width for Graphs of Bounded Tree-Width (Q4435348): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2112067601 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:25, 20 March 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
