A new decomposition technique for maximal clique enumeration for sparse graphs (Q1740688)
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 new decomposition technique for maximal clique enumeration for sparse graphs |
scientific article; zbMATH DE number 7050143
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new decomposition technique for maximal clique enumeration for sparse graphs |
scientific article; zbMATH DE number 7050143 |
Statements
A new decomposition technique for maximal clique enumeration for sparse graphs (English)
0 references
2 May 2019
0 references
enumeration
0 references
counting
0 references
algorithms
0 references
maximal cliques
0 references
\(k\)-degenerate graphs
0 references
0 references
0 references
0 references
0 references
0.871891975402832
0 references
0.8650158047676086
0 references
0.8423636555671692
0 references
0.8132995963096619
0 references
0.8038555383682251
0 references
