Minimum<i>s</i>-<i>t</i>Cut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time (Q3967060)
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: Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum<i>s</i>-<i>t</i>Cut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time |
scientific article |
Statements
Minimum<i>s</i>-<i>t</i>Cut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time (English)
0 references
1983
0 references
graph algorithm
0 references
