The Complexity of Multiterminal Cuts (Q4305362): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56077927, #quickstatements; #temporary_batch_1711565664090 |
Created claim: DBLP publication ID (P1635): journals/siamcomp/DahlhausJPSY94, #quickstatements; #temporary_batch_1735575912304 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/siamcomp/DahlhausJPSY94 / rank | |||
Normal rank | |||
Latest revision as of 17:30, 30 December 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
