Dynamic Approximate Vertex Cover and Maximum Matching (Q4933386): Difference between revisions

@@ Property / cites work @@
+Sparsification—a technique for speeding up dynamic graph algorithms
+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 @@
+Worst-case update times for fully-dynamic all-pairs shortest paths
+Normal rank
@@ Property / cites work @@
+A fully dynamic approximation scheme for shortest paths in planar graphs
+Normal rank
@@ Property / cites work @@
+Fully-dynamic min-cut
@@ Property / cites work: Fully-dynamic min-cut / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934589
@@ Property / cites work: Q2934589 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
+Normal rank
@@ Property / cites work @@
+On graph problems in a semi-streaming model
@@ Property / cites work: On graph problems in a semi-streaming model / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Weighted Matching in the Semi-Streaming Model
@@ Property / cites work: Weighted Matching in the Semi-Streaming Model / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed approximate matching
@@ Property / cites work: Distributed approximate matching / rank @@
+Normal rank