Finding the edge connectivity of directed graphs
- 1 March 1989
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 10 (1) , 76-85
- https://doi.org/10.1016/0196-6774(89)90024-2
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- On computing the connectivities of graphs and digraphsNetworks, 1984
- Bottlenecks and Edge Connectivity in Unsymmetrical NetworksSIAM Journal on Computing, 1979
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975