Listing all maximal cliques in sparse graphs in near-optimal time (Q3060751)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5825305
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Listing all maximal cliques in sparse graphs in near-optimal time |
scientific article; zbMATH DE number 5825305 |
Statements
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time (English)
0 references
9 December 2010
0 references
sparse graphs
0 references
\(d\)-degenerate graphs
0 references
maximal clique listing algorithms
0 references
Bron-Kerbosch algorithm
0 references
fixed-parameter tractability
0 references
0.9361574053764344
0 references
0.9008846282958984
0 references
0.8650158047676086
0 references
0.8517119884490967
0 references
0.8369370102882385
0 references
