An exact combinatorial algorithm for minimum graph bisection (Q747771): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Pregel / rank | |||
Normal rank | |||
Revision as of 21:48, 29 February 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
