The complexity of clique graph recognition (Q1019185)
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: The complexity of clique graph recognition |
scientific article; zbMATH DE number 5558990
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of clique graph recognition |
scientific article; zbMATH DE number 5558990 |
Statements
The complexity of clique graph recognition (English)
0 references
28 May 2009
0 references
clique graphs
0 references
NP-complete problems
0 references
Helly property
0 references
intersection graphs
0 references
0.9740701913833618
0 references
0.8929447531700134
0 references
0.8622637987136841
0 references
0.8520670533180237
0 references
