A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph
- 1 June 1992
- journal article
- Published by Springer Science and Business Media LLC in Algorithmica
- Vol. 7 (1-6), 583-596
- https://doi.org/10.1007/bf01758778
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Computing edge-connectivity in multiple and capacitated graphsLecture Notes in Computer Science, 1990
- Finding the Vertex Connectivity of GraphsSIAM Journal on Computing, 1980
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975