Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time
- 1 February 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 12 (1) , 71-81
- https://doi.org/10.1137/0212005
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- A Multiterminal Minimum Cut Algorithm for Planar GraphsSIAM Journal on Computing, 1980
- Maximum Flow in Planar NetworksSIAM Journal on Computing, 1979
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975
- Flows in NetworksPublished by Walter de Gruyter GmbH ,1963
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956