Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Michel A. Habib / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C69 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6033766 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
clique-width computation | |||
| Property / zbMATH Keywords: clique-width computation / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
polynomial-time algorithm | |||
| Property / zbMATH Keywords: polynomial-time algorithm / rank | |||
Normal rank | |||
Revision as of 20:29, 29 June 2023
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
