Algorithms for the maximum \(k\)-club problem in graphs (Q385488)
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: Algorithms for the maximum k-club problem in graphs |
scientific article; zbMATH DE number 6235162
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for the maximum \(k\)-club problem in graphs |
scientific article; zbMATH DE number 6235162 |
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
0 references
0.9007089734077454
0 references
0.8948171138763428
0 references
0.8822065591812134
0 references
0.8781021237373352
0 references
0.8758909106254578
0 references
