On the complexity of finding balanced oneway cuts (Q1014383)
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: On the complexity of finding balanced oneway cuts |
scientific article; zbMATH DE number 5547769
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of finding balanced oneway cuts |
scientific article; zbMATH DE number 5547769 |
Statements
On the complexity of finding balanced oneway cuts (English)
0 references
28 April 2009
0 references
bisection
0 references
directed graph
0 references
NP-hard
0 references
graph algorithms
0 references
0 references
0.8778148
0 references
0 references
0 references
0.86937875
0 references
0.8687613
0 references
0.86739373
0 references
