Computing Vertex Connectivity: New Bounds from Old Techniques
- 1 February 2000
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 34 (2) , 222-250
- https://doi.org/10.1006/jagm.1999.1055
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Directeds-t numberings, Rubber bands, and testing digraphk-vertex connectivityCombinatorica, 1994
- Improved Algorithms for Bipartite Network FlowSIAM Journal on Computing, 1994
- Efficient splitting off algorithms for graphsPublished by Association for Computing Machinery (ACM) ,1994
- A Fast Parametric Maximum Flow Algorithm and ApplicationsSIAM Journal on Computing, 1989
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- A probabilistic algorithm for vertex connectivity of graphsInformation Processing Letters, 1982
- On the Asymptotic Complexity of Matrix MultiplicationSIAM Journal on Computing, 1982
- Finding the Vertex Connectivity of GraphsSIAM Journal on Computing, 1980
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975
- An Algorithm for Determining Whether the Connectivity of a Graph is at LeastkSIAM Journal on Computing, 1975