Maintaining minimum spanning forests in dynamic graphs
From MaRDI portal
Recommendations
- Maintaining minimum spanning trees in dynamic graphs
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation
- Faster Fully-Dynamic Minimum Spanning Forest
- Maintenance of a minimum spanning forest in a dynamic plane graph
- Fully-dynamic minimum spanning forest with improved worst-case update time
Cited in
(26)- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Dynamic kernels for hitting sets and set packing
- Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms
- Maintenance of a minimum spanning forest in a dynamic plane graph
- Upper and lower bounds for fully retroactive graph problems
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation
- Maintaining dynamic minimum spanning trees: an experimental study
- scientific article; zbMATH DE number 1617242 (Why is no real title available?)
- Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
- Fully-dynamic minimum spanning forest with improved worst-case update time
- Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and \(O(n^{1/2-\epsilon})\)-time
- Maintaining centdians in a fully dynamic forest with top trees
- scientific article; zbMATH DE number 1775391 (Why is no real title available?)
- Constant-time dynamic weight approximation for minimum spanning forest
- Faster Fully-Dynamic Minimum Spanning Forest
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures
- Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations
- A new deterministic algorithm for fully dynamic all-pairs shortest paths
- Multiple-edge-fault-tolerant approximate shortest-path trees
- Maintaining minimum spanning trees in dynamic graphs
- Fully dynamic arboricity maintenance
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization
- Maintaining Nets and Net Trees under Incremental Motion
- Algorithmic techniques for maintaining shortest routes in dynamic networks
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
- scientific article; zbMATH DE number 1926664 (Why is no real title available?)
This page was built for publication: Maintaining minimum spanning forests in dynamic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784458)
