Exploiting sparsity for the min \(k\)-partition problem (Q2175445): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q127597281, #quickstatements; #temporary_batch_1721927112556 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s12532-019-00165-3 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S12532-019-00165-3 / rank | |||
Normal rank | |||
Latest revision as of 08:54, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exploiting sparsity for the min \(k\)-partition problem |
scientific article |
Statements
Exploiting sparsity for the min \(k\)-partition problem (English)
0 references
29 April 2020
0 references
integer programming
0 references
graph partitioning
0 references
semidefinite programming
0 references
chordal graph
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
