Fast maximal cliques enumeration in sparse graphs (Q1949748)
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: Fast maximal cliques enumeration in sparse graphs |
scientific article; zbMATH DE number 6163652
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast maximal cliques enumeration in sparse graphs |
scientific article; zbMATH DE number 6163652 |
Statements
Fast maximal cliques enumeration in sparse graphs (English)
0 references
16 May 2013
0 references
maximal clique
0 references
polynomial delay
0 references
sparse graph
0 references
\(H\)-partition
0 references
\(H\)-value
0 references
0 references
