Fast maximal cliques enumeration in sparse graphs (Q1949748): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-012-9632-8 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-012-9632-8 / rank | |||
Normal rank | |||
Latest revision as of 15:09, 16 December 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
0 references
