Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285): Difference between revisions
From MaRDI portal
Latest revision as of 05:22, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Polynomial-time recognition of clique-width \(\leq 3\) graphs |
scientific article |
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