Improved algorithms for graph four- connectivity
- 30 June 1991
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 42 (3) , 288-306
- https://doi.org/10.1016/0022-0000(91)90004-o
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An Efficient Parallel Biconnectivity AlgorithmSIAM Journal on Computing, 1985
- A probabilistic algorithm for vertex connectivity of graphsInformation Processing Letters, 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
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Non-separable and planar graphsTransactions of the American Mathematical Society, 1932