Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs (Q479213): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S11590-013-0698-2 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11590-013-0698-2 / rank | |||
Normal rank | |||
Latest revision as of 18:48, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs |
scientific article |
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
