Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s12532-022-00228-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4309305091 / rank | |||
Normal rank | |||
Revision as of 10:53, 30 July 2024
scientific article; zbMATH DE number 7700967
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations |
scientific article; zbMATH DE number 7700967 |
Statements
Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (English)
0 references
23 June 2023
0 references
graph partitioning
0 references
integer programming
0 references
critical element detection
0 references
branch-and-cut
0 references
dynamic programming
0 references
