A new decomposition technique for maximal clique enumeration for sparse graphs (Q1740688): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by the same user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2018.10.014 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2018.10.014 / rank | |||
Normal rank | |||
Latest revision as of 07:23, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new decomposition technique for maximal clique enumeration for sparse graphs |
scientific article |
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
