Pages that link to "Item:Q4377592"
From MaRDI portal
The following pages link to Sparsification—a technique for speeding up dynamic graph algorithms (Q4377592):
Displaying 12 items.
- (Q5116480) (← links)
- Determinant-Preserving Sparsification of SDDM Matrices (Q5117381) (← links)
- Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)
- Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Q5252659) (← links)
- A consistent semantics of self-adjusting computation (Q5398334) (← links)
- (Q5743413) (← links)
- (Q5874528) (← links)
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions (Q6139829) (← links)
- Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries (Q6173217) (← links)
- Multi-priority graph sparsification (Q6182885) (← links)
- Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time (Q6566592) (← links)
- On partitioning minimum spanning trees (Q6633521) (← links)