A new decomposition technique for maximal clique enumeration for sparse graphs (Q1740688): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2018.10.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2897305385 / rank | |||
Normal rank | |||
Revision as of 20:18, 19 March 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
