Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs (Q479213): 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/s11590-013-0698-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W80045804 / rank | |||
Normal rank | |||
Revision as of 00:29, 20 March 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
