Fully Dynamic Matching in Bipartite Graphs (Q3448782): Difference between revisions

@@ Property / cites work @@
+Fully Dynamic Maximal Matching in O (log n) Update Time
+Normal rank
@@ Property / cites work @@
+Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
+Normal rank
@@ Property / cites work @@
+Linear-Time Approximation for Maximum Weight Matching
+Normal rank
@@ Property / cites work @@
+Online Stochastic Packing Applied to Display Ad Allocation
+Normal rank
@@ Property / cites work @@
+The Distribution of a Product from Several Sources to Numerous Localities
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Q5838558
@@ Property / cites work: Q5838558 / rank @@
+Normal rank
@@ Property / cites work @@
+Orienting Fully Dynamic Graphs with Worst-Case Time Bounds
+Normal rank
@@ Property / cites work @@
+AdWords and generalized online matching
@@ Property / cites work: AdWords and generalized online matching / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+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 @@
+Q2934589
@@ Property / cites work: Q2934589 / rank @@
+Normal rank