Pages that link to "Item:Q4978052"
From MaRDI portal
The following pages link to Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n<sup>1/2 - ε</sup>)-time (Q4978052):
Displaying 10 items.
- Constant-time dynamic weight approximation for minimum spanning forest (Q2051831) (← links)
- Faster connectivity in low-rank hypergraphs via expander decomposition (Q2164680) (← links)
- Fully-dynamic minimum spanning forest with improved worst-case update time (Q4978053) (← links)
- Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
- Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)
- Deterministic dynamic matching in worst-case update time (Q6066769) (← links)
- Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover (Q6081760) (← links)
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions (Q6139829) (← links)
- Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time (Q6566592) (← links)
- Good \(r\)-divisions imply optimal amortized decremental biconnectivity (Q6614619) (← links)
