An exact combinatorial algorithm for minimum graph bisection (Q747771): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S10107-014-0811-Z / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10107-014-0811-Z / rank | |||
Normal rank | |||
Latest revision as of 03:00, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact combinatorial algorithm for minimum graph bisection |
scientific article |
Statements
An exact combinatorial algorithm for minimum graph bisection (English)
0 references
19 October 2015
0 references
bisection
0 references
branch-and-bound
0 references
graph partition
0 references
combinatorial algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
