Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components
From MaRDI portal
Recommendations
- Distributed edge connectivity in sublinear time
- Small cuts and connectivity certificates: a fault tolerant approach
- An efficient \({\mathcal {NC}}\) algorithm for a sparse \(k\)-edge-connectivity certificate
- scientific article; zbMATH DE number 1303037
- Certificates and fast algorithms for biconnectivity in fully-dynamic graphs
Cited in
(12)- On mixed connectivity certificates
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots
- An efficient \({\mathcal {NC}}\) algorithm for a sparse \(k\)-edge-connectivity certificate
- Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains
- Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity
- scientific article; zbMATH DE number 1303037 (Why is no real title available?)
- A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
- Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem
- Small cuts and connectivity certificates: a fault tolerant approach
- Finding a small vertex cut on distributed networks
- Near-optimal distributed computation of small vertex cuts
- Stochastic distance in property testing
This page was built for publication: Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3128991)
