Revisiting a simple algorithm for the planar multiterminal cut problem (Q991478)
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: Revisiting a simple algorithm for the planar multiterminal cut problem |
scientific article; zbMATH DE number 5780115
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Revisiting a simple algorithm for the planar multiterminal cut problem |
scientific article; zbMATH DE number 5780115 |
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
0.8252755403518677
0 references
0.8235089182853699
0 references
0.8149366974830627
0 references
0.8139937520027161
0 references
