Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity
- 1 February 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (1), 157-174
- https://doi.org/10.1137/0222013
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Successive approximation in parallel graph algorithmsTheoretical Computer Science, 1990
- Parallel Depth-First Search in General Directed GraphsSIAM Journal on Computing, 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
- An improved parallel algorithm that computes the BFS numbering of a directed graphInformation Processing Letters, 1988
- A random 1-011-011-01algorithm for depth first searchCombinatorica, 1988
- Connectivity requirements for Byzantine agreement under restricted types of failuresDistributed Computing, 1987
- Fast parallel matrix and GCD computationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,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