Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time (Q3092225)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time |
scientific article |
Statements
Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time (English)
0 references
16 September 2011
0 references
