The Complexity of Multiterminal Cuts (Q4305362): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:51, 6 February 2024
scientific article; zbMATH DE number 638387
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Multiterminal Cuts |
scientific article; zbMATH DE number 638387 |
Statements
The Complexity of Multiterminal Cuts (English)
0 references
17 October 1994
0 references
NP-completeness
0 references
network flow
0 references
partitioning
0 references
planar graphs
0 references
multiterminal cut problem
0 references
