Fast maximal cliques enumeration in sparse graphs (Q1949748): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 457 / rank | |||
Normal rank | |||
Revision as of 13:35, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast maximal cliques enumeration in sparse graphs |
scientific article |
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
