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 the normal view instead:
scientific article; zbMATH DE number 3789845
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum<i>s</i>-<i>t</i>Cut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time |
scientific article; zbMATH DE number 3789845 |
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
