Directeds-t numberings, Rubber bands, and testing digraphk-vertex connectivity
- 1 December 1994
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 14 (4) , 435-451
- https://doi.org/10.1007/bf01302965
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex ConnectivitySIAM Journal on Computing, 1993
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphsJournal of Algorithms, 1988
- The multi-tree approach to reliability in distributed networksInformation and Computation, 1988
- Improved processor bounds for combinatorial problems in RNCCombinatorica, 1988
- Rubber bands, convex embeddings and graph connectivityCombinatorica, 1988
- Constructing a perfect matching is in random NCCombinatorica, 1986
- A probabilistic algorithm for vertex connectivity of graphsInformation Processing Letters, 1982
- Finding the Vertex Connectivity of GraphsSIAM Journal on Computing, 1980
- An Algorithm for Determining Whether the Connectivity of a Graph is at LeastkSIAM Journal on Computing, 1975