Optimal decremental connectivity in planar graphs (Q1693990): Difference between revisions

@@ Property / cites work @@
+Optimal on-line decremental connectivity in trees
@@ Property / cites work: Optimal on-line decremental connectivity in trees / rank @@
+Normal rank
@@ Property / cites work @@
+Sparsification—a technique for speeding up dynamic graph algorithms
+Normal rank
@@ Property / cites work @@
+Separator based sparsification. I: Planarity testing and minimum spanning trees
+Normal rank
@@ Property / cites work @@
+Maintenance of a minimum spanning forest in a dynamic plane graph
+Normal rank
@@ Property / cites work @@
+Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
+Normal rank
@@ Property / cites work @@
+Decremental 2- and 3-connectivity on planar graphs
+Normal rank
@@ Property / cites work @@
+Efficient Union-Find for planar graphs and other sparse graph classes
+Normal rank
@@ Property / cites work @@
+Randomized fully dynamic graph algorithms with polylogarithmic time per operation
+Normal rank
@@ Property / cites work @@
+Lower bounds for fully dynamic connectivity problems in graphs
+Normal rank
@@ Property / cites work @@
+Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
+Normal rank
@@ Property / cites work @@
+Dynamic graph connectivity in polylogarithmic worst case time
+Normal rank
@@ Property / cites work @@
+Faster worst case deterministic dynamic connectivity
+Normal rank
@@ Property / cites work @@
+Structured recursive separator decompositions for planar graphs in linear time
+Normal rank
@@ Property / cites work @@
+Logarithmic Lower Bounds in the Cell-Probe Model
@@ Property / cites work: Logarithmic Lower Bounds in the Cell-Probe Model / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for the union-find and the split-find problem on pointer machines
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank
@@ Property / cites work @@
+A class of algorithms which require nonlinear time to maintain disjoint sets
+Normal rank
@@ Property / cites work @@
+Decremental Dynamic Connectivity
@@ Property / cites work: Decremental Dynamic Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Near-optimal fully-dynamic graph connectivity
@@ Property / cites work: Near-optimal fully-dynamic graph connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs
+Normal rank
@@ Property / cites work @@
+Faster Deterministic Fully-Dynamic Graph Connectivity
+Normal rank