A note on the problem of reporting maximal cliques (Q955035)
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: A note on the problem of reporting maximal cliques |
scientific article; zbMATH DE number 5368358
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the problem of reporting maximal cliques |
scientific article; zbMATH DE number 5368358 |
Statements
A note on the problem of reporting maximal cliques (English)
0 references
18 November 2008
0 references
maximal cliques
0 references
output sensitive algorithms
0 references
maximal common subgraphs
0 references
enumeration problems
0 references
0.8160104751586914
0 references
0.8066704273223877
0 references
0.7944004535675049
0 references
0.7835221290588379
0 references
0.781587541103363
0 references
