Theoretical underpinnings for maximal clique enumeration on perturbed graphs (Q974747)
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 5717735
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Theoretical underpinnings for maximal clique enumeration on perturbed graphs |
scientific article; zbMATH DE number 5717735 |
Statements
Theoretical underpinnings for maximal clique enumeration on perturbed graphs (English)
0 references
7 June 2010
0 references
graph perturbation theory
0 references
maximal clique enumeration
0 references
graph algorithms
0 references
uncertain and noisy data
0 references
0 references
0 references
0.758976936340332
0 references
0.7397046089172363
0 references
0.7366824746131897
0 references
0.731118381023407
0 references
0.7309746742248535
0 references
