An exact combinatorial algorithm for minimum graph bisection (Q747771): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:25, 30 January 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
