Sub-linear distributed algorithms for sparse certificates and biconnected components

Authors:
Ramakrishna Thurimella
Affiliations:
Department of Mathematics and Computer Science, University of Denver, Denver, CO
Venue:
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Year:
1995

Citing 5
Cited 3

The multi-tree approach to reliability in distributed networks

Information and Computation
How to find biconnected components in distributed networks

Journal of Parallel and Distributed Computing
Scan-first search and sparse certificates: an improved parallel algorithm for k-vertex connectivity

SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Techniques for the design of parallel graph algorithms

Techniques for the design of parallel graph algorithms

A simple randomized scheme for constructing low-weight k-connected spanning subgraphs with applications to distributed algorithms

Theoretical Computer Science
Distributed approximation algorithms for finding 2-edge-connected subgraphs

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Reliably detecting connectivity using local graph traits

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems

Quantified Score

Hi-index	0.00

Visualization

Abstract