Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285)
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 6033766
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time recognition of clique-width \(\leq 3\) graphs |
scientific article; zbMATH DE number 6033766 |
Statements
Polynomial-time recognition of clique-width \(\leq 3\) graphs (English)
0 references
11 May 2012
0 references
clique-width computation
0 references
polynomial-time algorithm
0 references
0 references
0.8369300365447998
0 references
0.8330682516098022
0 references
0.8274518847465515
0 references
