Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- 1 February 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 5 (1), 54-66
- https://doi.org/10.1137/0405004
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graphAlgorithmica, 1992
- Finding the Vertex Connectivity of GraphsSIAM Journal on Computing, 1980
- Bottlenecks and Edge Connectivity in Unsymmetrical 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