The Complexity of Multiterminal Cuts (Q4305362): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56077927, #quickstatements; #temporary_batch_1711565664090 |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: David S. Johnson / rank | |||
| Property / author | |||
| Property / author: Q197784 / rank | |||
| Property / author | |||
| Property / author: P. D. Seymour / rank | |||
| Property / author | |||
| Property / author: David S. Johnson / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Christos H. Papadimitriou / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: P. D. Seymour / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56077927 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:29, 27 March 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
