An output sensitive algorithm for maximal clique enumeration in sparse graphs (Q5111887)
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 output sensitive algorithm for maximal clique enumeration in sparse graphs |
scientific article; zbMATH DE number 7205211
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An output sensitive algorithm for maximal clique enumeration in sparse graphs |
scientific article; zbMATH DE number 7205211 |
Statements
27 May 2020
0 references
enumeration algorithms
0 references
maximal cliques
0 references
\(k\)-degenerate graphs
0 references
0 references
0 references
0 references
0.9008846282958984
0 references
0.871891975402832
0 references
0.8385304808616638
0 references
0.8149142265319824
0 references
