An algorithm for reporting maximal \(c\)-cliques (Q817824)
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: An algorithm for reporting maximal c-cliques |
scientific article; zbMATH DE number 5013324
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for reporting maximal \(c\)-cliques |
scientific article; zbMATH DE number 5013324 |
Statements
An algorithm for reporting maximal \(c\)-cliques (English)
0 references
20 March 2006
0 references
maximal \(c\)-connected cliques
0 references
maximal-cliques
0 references
maximal common induced/edge subgraphs
0 references
shape matching
0 references
0 references
0.9467328
0 references
0 references
0 references
0.9221652
0 references
0.9208955
0 references
0.91554624
0 references
0.91364735
0 references
0.91091204
0 references
0.90656364
0 references
