Maintenance of a minimum spanning forest in a dynamic plane graph
From MaRDI portal
Recommendations
- Maintaining minimum spanning forests in dynamic graphs
- Maintaining minimum spanning trees in dynamic graphs
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- Separator based sparsification. I: Planarity testing and minimum spanning trees
- scientific article; zbMATH DE number 176746
Cited in
(51)- Dynamic Trees and Dynamic Point Location
- Planar and grid graph reachability problems
- Maintaining dynamic minimum spanning trees: an experimental study
- Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time
- Dynamic maintenance of shortest path trees in simple polygons
- Efficient authenticated data structures for graph connectivity and geometric search problems
- Dynamic connectivity in disk graphs
- Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs
- Efficient algorithms for computing Reeb graphs
- Dynamic maintenance of planar digraphs, with applications
- Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
- FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE
- Good r-divisions imply optimal amortized decremental biconnectivity
- Dynamic connectivity in digital images
- scientific article; zbMATH DE number 1617247 (Why is no real title available?)
- The painter's problem: covering a grid with colored connected polygons
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs.
- Decremental SPQR-trees for Planar Graphs
- Minimum-weight spanning tree algorithms. A survey and empirical study
- On-line convex planarity testing
- Good \(r\)-divisions imply optimal amortized decremental biconnectivity
- A uniform self-stabilizing minimum diameter spanning tree algorithm
- Multi-period maintenance scheduling of tree networks with minimum flow disruption
- Competitive graph searches
- Maintaining minimum spanning forests in dynamic graphs
- Dynamic 2- and 3-connectivity on planar graphs
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING
- scientific article; zbMATH DE number 177564 (Why is no real title available?)
- Maintaining spanning trees of small diameter
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
- Maintaining centdians in a fully dynamic forest with top trees
- On partitioning minimum spanning trees
- Constant-time dynamic weight approximation for minimum spanning forest
- Single-source shortest paths and strong connectivity in dynamic planar graphs
- A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
- Dynamic expression trees
- Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations
- Separator based sparsification. I: Planarity testing and minimum spanning trees
- Lower bounds for dynamic algorithms
- Optimal decremental connectivity in planar graphs
- Maintaining minimum spanning trees in dynamic graphs
- Fully Dynamic Transitive Closure in plane dags with one source and one sink
- Maintaining Nets and Net Trees under Incremental Motion
- Incremental convex planarity testing
- Dynamic planar embeddings of dynamic graphs
- Decremental 2- and 3-connectivity on planar graphs
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
- Efficient Extraction of Multiple Kuratowski Subdivisions
- scientific article; zbMATH DE number 7238975 (Why is no real title available?)
- scientific article; zbMATH DE number 1926664 (Why is no real title available?)
- Nearly linear time minimum spanning tree maintenance for transient node failures
This page was built for publication: Maintenance of a minimum spanning forest in a dynamic plane graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3990614)
