A Multiterminal Minimum Cut Algorithm for Planar Graphs
- 1 May 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 9 (2) , 219-224
- https://doi.org/10.1137/0209020
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Maximum Flow in Planar NetworksSIAM Journal on Computing, 1979
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961