Pages that link to "Item:Q4978053"
From MaRDI portal
The following pages link to Fully-dynamic minimum spanning forest with improved worst-case update time (Q4978053):
Displaying 11 items.
- Constant-time dynamic weight approximation for minimum spanning forest (Q2051831) (← links)
- Constructing light spanners deterministically in near-linear time (Q2077383) (← links)
- Faster connectivity in low-rank hypergraphs via expander decomposition (Q2164680) (← links)
- Maintaining minimum spanning forests in dynamic graphs (Q2784458) (← links)
- Faster Fully-Dynamic Minimum Spanning Forest (Q3452837) (← links)
- Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n<sup>1/2 - ε</sup>)-time (Q4978052) (← links)
- Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
- Improved Dynamic Graph Coloring (Q5009642) (← links)
- Constructing Light Spanners Deterministically in Near-Linear Time (Q5075736) (← links)
- Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)
- Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time (Q6566592) (← links)