An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem (Q3689216)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3912421
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem |
scientific article; zbMATH DE number 3912421 |
Statements
An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem (English)
0 references
1985
0 references
3-cut
0 references
algorithm
0 references
planar graph
0 references
0.94014275
0 references
0 references
0.9010521
0 references
0.8983579
0 references
0 references
0.8943602
0 references
0.8907548
0 references
