Clique Graph Recognition Is NP-Complete (Q3522963)
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 5321110
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Clique Graph Recognition Is NP-Complete |
scientific article; zbMATH DE number 5321110 |
Statements
Clique Graph Recognition Is NP-Complete (English)
0 references
4 September 2008
0 references
0.9740701913833618
0 references
0.8709132075309753
0 references
0.8576127290725708
0 references
0.853111743927002
0 references
