An exact combinatorial algorithm for minimum graph bisection (Q747771)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An exact combinatorial algorithm for minimum graph bisection |
scientific article; zbMATH DE number 6495758
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact combinatorial algorithm for minimum graph bisection |
scientific article; zbMATH DE number 6495758 |
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
0 references
0.9443645
0 references
0.9073926
0 references
0.90438706
0 references
0.9041935
0 references
0 references
0.90021527
0 references
