Pages that link to "Item:Q3990614"

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

Displayed 21 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)
• 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)
• Efficient Extraction of Multiple Kuratowski Subdivisions (Q5452219) ‎ (← links)
• FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE (Q5694056) ‎ (← links)
• Minimum-weight spanning tree algorithms. A survey and empirical study (Q5953166) ‎ (← links)