Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs (Q479213)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving maximum clique in sparse graphs: an O(nm+n2d/4) algorithm for d-degenerate graphs |
scientific article; zbMATH DE number 6377191
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs |
scientific article; zbMATH DE number 6377191 |
Statements
Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs (English)
0 references
5 December 2014
0 references
maximum clique
0 references
degeneracy
0 references
sparse graphs
0 references
fixed-parameter
0 references
tractability
0 references
\(d\)-degenerate graphs
0 references
0 references
0.9178723
0 references
0.91343266
0 references
0.90801924
0 references
0.9049024
0 references
0.90455085
0 references
0.9038837
0 references
0.9024205
0 references
0.90207946
0 references
