Pages that link to "Item:Q3128991"
From MaRDI portal
The following pages link to Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components (Q3128991):
Displaying 8 items.
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (Q259059) (← links)
- On mixed connectivity certificates (Q1274334) (← links)
- An efficient \({\mathcal {NC}}\) algorithm for a sparse \(k\)-edge-connectivity certificate (Q2729643) (← links)
- Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains (Q3522906) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem (Q5323050) (← links)
- Small cuts and connectivity certificates: a fault tolerant approach (Q6487547) (← links)
- Near-optimal distributed computation of small vertex cuts (Q6579850) (← links)
