Pages that link to "Item:Q3990614"

The following pages link to Maintenance of a minimum spanning forest in a dynamic plane graph (Q3990614):

Displaying 33 items.

• Dynamic connectivity in digital images (Q290227) (← links)
• Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
• Efficient authenticated data structures for graph connectivity and geometric search problems (Q548654) (← links)
• Planar and grid graph reachability problems (Q733742) (← links)
• Efficient algorithms for computing Reeb graphs (Q924077) (← links)
• Maintaining dynamic minimum spanning trees: an experimental study (Q968158) (← links)
• A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs (Q1322567) (← links)
• Dynamic expression trees (Q1346771) (← links)
• Optimal decremental connectivity in planar graphs (Q1693990) (← links)
• Dynamic planar embeddings of dynamic graphs (Q1693993) (← links)
• Incremental convex planarity testing (Q1854448) (← links)
• Decremental 2- and 3-connectivity on planar graphs (Q1924402) (← links)
• Constant-time dynamic weight approximation for minimum spanning forest (Q2051831) (← links)
• Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
• Competitive graph searches (Q2481952) (← links)
• Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning (Q2515049) (← links)
• Dynamic Trees and Dynamic Point Location (Q4210167) (← links)
• The Painter’s Problem: Covering a Grid with Colored Connected Polygons (Q4625138) (← links)
• Maintaining spanning trees of small diameter (Q4632429) (← links)
• A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING (Q4682177) (← links)
• Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
• Dynamic 2- and 3-connectivity on planar graphs (Q5056143) (← links)
• Lower bounds for dynamic algorithms (Q5056175) (← links)
• (Q5116484) (← links)
• Efficient Extraction of Multiple Kuratowski Subdivisions (Q5452219) (← links)
• FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE (Q5694056) (← links)
• Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
• Minimum-weight spanning tree algorithms. A survey and empirical study (Q5953166) (← links)
• A uniform self-stabilizing minimum diameter spanning tree algorithm (Q6084561) (← links)
• Dynamic connectivity in disk graphs (Q6145677) (← links)
• Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time (Q6566592) (← links)
• Good \(r\)-divisions imply optimal amortized decremental biconnectivity (Q6614619) (← links)
• On partitioning minimum spanning trees (Q6633521) (← links)