Randomization for Efficient Dynamic Graph Algorithms (Q2795930): Difference between revisions

@@ Property / cites work @@
+On Dynamic DFS Tree in Directed Graphs
@@ Property / cites work: On Dynamic DFS Tree in Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fully Dynamic Maximal Matching in $O(\log n)$ Update Time
+Normal rank
@@ Property / cites work @@
+Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
+Normal rank
@@ Property / cites work @@
+Fully dynamic randomized algorithms for graph spanners
+Normal rank
@@ Property / cites work @@
+A new approach to dynamic all pairs shortest paths
+Normal rank
@@ Property / cites work @@
+Sparsification—a technique for speeding up dynamic graph algorithms
+Normal rank
@@ Property / cites work @@
+An On-Line Edge-Deletion Problem
@@ Property / cites work: An On-Line Edge-Deletion Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
+Normal rank
@@ Property / cites work @@
+Q3579450
@@ Property / cites work: Q3579450 / rank @@
+Normal rank
@@ Property / cites work @@
+Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs
+Normal rank
@@ Property / cites work @@
+Randomized fully dynamic graph algorithms with polylogarithmic time per operation
+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 @@
+A fully dynamic algorithm for maintaining the transitive closure
+Normal rank
@@ Property / cites work @@
+Improved Dynamic Reachability Algorithms for Directed Graphs
+Normal rank
@@ Property / cites work @@
+Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs
+Normal rank
@@ Property / cites work @@
+Decremental Dynamic Connectivity
@@ Property / cites work: Decremental Dynamic Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-case update times for fully-dynamic all-pairs shortest paths
+Normal rank
@@ Property / cites work @@
+Fully-dynamic min-cut
@@ Property / cites work: Fully-dynamic min-cut / rank @@
+Normal rank