Fast maximal cliques enumeration in sparse graphs (Q1949748): 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.1007/s00453-012-9632-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1983365058 / rank | |||
Normal rank | |||
Revision as of 20:29, 19 March 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
