Pages that link to "Item:Q2784458"
From MaRDI portal
The following pages link to Maintaining minimum spanning forests in dynamic graphs (Q2784458):
Displaying 19 items.
- Maintaining centdians in a fully dynamic forest with top trees (Q479062) (← links)
- 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)
- Faster Fully-Dynamic Minimum Spanning Forest (Q3452837) (← links)
- Maintaining Nets and Net Trees under Incremental Motion (Q3652299) (← links)
- Maintenance of a minimum spanning forest in a dynamic plane graph (Q3990614) (← links)
- Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations (Q4602377) (← links)
- Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n<sup>1/2 - ε</sup>)-time (Q4978052) (← links)
- Fully-dynamic minimum spanning forest with improved worst-case update time (Q4978053) (← links)
- Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms (Q5002673) (← links)
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity (Q5441357) (← links)
- Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
