Succinct data structures for bounded clique-width graphs (Q6497944)
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: Succinct data structures for bounded clique-width graphs |
scientific article; zbMATH DE number 7843504
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Succinct data structures for bounded clique-width graphs |
scientific article; zbMATH DE number 7843504 |
Statements
Succinct data structures for bounded clique-width graphs (English)
0 references
6 May 2024
0 references
succinct data structures
0 references
bounded clique-width graphs
0 references
cographs
0 references
distance hereditary graphs
0 references
0 references
0.8363633155822754
0 references
0.7537403106689453
0 references
0.7434266209602356
0 references
0.7399864792823792
0 references
0.7329174876213074
0 references
