Parallel Spanning Forest and Biconnectivity for Well-Connected Graph in Sub-Logarithmic Time
cs.DS
Submitted: 2026-11-11
Updated: 2026-11-11
Terminology
Sources
- Log Diameter Rounds Algorithms for $2$-Vertex and $2$-Edge Connectivity
- Connected Components on a PRAM in Log Diameter Time
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time