Pages that link to "Item:Q2784458"
From MaRDI portal
The following pages link to Maintaining Minimum Spanning Forests in Dynamic Graphs (Q2784458):
Displaying 11 items.
- Upper and lower bounds for fully retroactive graph problems (Q832892) (← links)
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures (Q849628) (← links)
- Maintaining dynamic minimum spanning trees: an experimental study (Q968158) (← links)
- Constant-time dynamic weight approximation for minimum spanning forest (Q2051831) (← links)
- Multiple-edge-fault-tolerant approximate shortest-path trees (Q2072097) (← links)
- Dynamic kernels for hitting sets and set packing (Q2093581) (← links)
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning (Q2515049) (← links)
- Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization (Q2816298) (← links)
- Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks (Q2864176) (← links)
- (Q5002673) (← links)
- Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
