Finding k Cuts within Twice the Optimal
- 1 February 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 24 (1), 101-108
- https://doi.org/10.1137/s0097539792251730
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- An improved algorithm for the planar 3-cut problemJournal of Algorithms, 1991
- An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut ProblemSIAM Journal on Algebraic Discrete Methods, 1985
- Optimal attack and reinforcement of a networkJournal of the ACM, 1985
- Connectivity and edge-disjoint spanning treesInformation Processing Letters, 1983
- Tough graphs and hamiltonian circuitsDiscrete Mathematics, 1973
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961