Matching is as easy as matrix inversion
Combinatorica
The multi-tree approach to reliability in distributed networks
Information and Computation
Computing edge-connectivity in multiple and capacitated graphs
SIGAL '90 Proceedings of the international symposium on Algorithms
On determining vertex connectivity
On determining vertex connectivity
Improved algorithms for graph four-connectivity
Journal of Computer and System Sciences
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Finding Triconnected Components by Local Replacements
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Techniques for the design of parallel graph algorithms
Techniques for the design of parallel graph algorithms
Extremal Graph Theory
Clique partitions, graph compression and speeding-up algorithms
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Biconnectivity approximations and graph carvings
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Biconnectivity approximations and graph carvings
Journal of the ACM (JACM)
Approximating biconnectivity in parallel
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
Improving biconnectivity approximation via local optimization
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Dynamic bottleneck optimization for k-edge and 2-vertex connectivity
Information Processing Letters
The Balanced Decomposition Number and Vertex Connectivity
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |