Finding a Maximum Clique in an Arbitrary Graph (Q3741641)
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 3974983
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a Maximum Clique in an Arbitrary Graph |
scientific article; zbMATH DE number 3974983 |
Statements
Finding a Maximum Clique in an Arbitrary Graph (English)
0 references
1986
0 references
vertex packing
0 references
triangulated subgraphs
0 references
k-chromatic subgraphs
0 references
implicit enumeration
0 references
maximum clique
0 references
0.9033393263816832
0 references
0.883407711982727
0 references
0.8821436762809753
0 references
0.8719725608825684
0 references
