The worst-case time complexity for generating all maximal cliques and computational experiments (Q860810)
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 5083476
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The worst-case time complexity for generating all maximal cliques and computational experiments |
scientific article; zbMATH DE number 5083476 |
Statements
The worst-case time complexity for generating all maximal cliques and computational experiments (English)
0 references
9 January 2007
0 references
maximal cliques
0 references
enumeration
0 references
worst-case time complexity
0 references
computational experiments
0 references
0.9735215306282043
0 references
0.8140081167221069
0 references
0.8038926720619202
0 references
0.7877553701400757
0 references
0.7854412794113159
0 references
