Q5009521 (Q5009521): Difference between revisions

@@ Property / cites work @@
+Dynamic ordered sets with exponential search trees
+Normal rank
@@ Property / cites work @@
+Fully Dynamic Maximal Matching in $O(\log n)$ Update Time
+Normal rank
@@ Property / cites work @@
+Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in <i>O</i>(log<sup>3</sup> <i>n</i>) Worst Case Update Time
+Normal rank
@@ Property / cites work @@
+Deterministic fully dynamic approximate vertex cover and fractional matching in \(O(1)\) amortized update time
+Normal rank
@@ Property / cites work @@
+Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
+Normal rank
@@ Property / cites work @@
+Design of Dynamic Algorithms via Primal-Dual Method
+Normal rank
@@ Property / cites work @@
+A new approach to dynamic all pairs shortest paths
+Normal rank
@@ Property / cites work @@
+Capacitated vertex covering
@@ Property / cites work: Capacitated vertex covering / rank @@
+Normal rank
@@ Property / cites work @@
+Online and dynamic algorithms for set cover
@@ Property / cites work: Online and dynamic algorithms for set cover / rank @@
+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 @@
+Simple Deterministic Algorithms for Fully Dynamic Maximal Matching
+Normal rank
@@ Property / cites work @@
+Maintaining a large matching and a small vertex cover
+Normal rank
@@ Property / cites work @@
+Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach
+Normal rank