Revisiting a simple algorithm for the planar multiterminal cut problem (Q991478): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.orl.2010.03.003 / rank | |||
| Property / cites work | |||
| Property / cites work: New results on planar and directed multicuts / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Complexity of Multiterminal Cuts / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The planar multiterminal cut problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Simple Algorithm for the Planar Multiway Cut Problem / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ORL.2010.03.003 / rank | |||
Normal rank | |||
Latest revision as of 11:30, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Revisiting a simple algorithm for the planar multiterminal cut problem |
scientific article |
Statements
Revisiting a simple algorithm for the planar multiterminal cut problem (English)
0 references
7 September 2010
0 references
planar graph
0 references
multiterminal cut
0 references
algorithm
0 references
counterexample
0 references
