Algorithms for the maximum \(k\)-club problem in graphs (Q385488): 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/s10878-012-9473-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2077064858 / rank | |||
Normal rank | |||
Revision as of 02:16, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for the maximum \(k\)-club problem in graphs |
scientific article |
Statements
Algorithms for the maximum \(k\)-club problem in graphs (English)
0 references
2 December 2013
0 references
maximum \(k\)-club
0 references
clique relaxations
0 references
variable neighborhood search
0 references
