Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Q5252659): Difference between revisions

@@ Property / author @@
-Sandeep Sen
@@ Property / author: Sandeep Sen / rank @@
-Normal rank
@@ Property / author @@
+Sandeep Sen
@@ Property / author: Sandeep Sen / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1137/130914140
@@ Property / full work available at URL: https://doi.org/10.1137/130914140 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2178621981
@@ Property / OpenAlex ID: W2178621981 / rank @@
+Normal rank
@@ Property / cites work @@
+Popular Matchings
@@ Property / cites work: Popular Matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886061
@@ Property / cites work: Q4886061 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2957502
@@ Property / cites work: Q2957502 / rank @@
+Normal rank
@@ Property / cites work @@
+Fully dynamic randomized algorithms for graph spanners
+Normal rank
@@ Property / cites work @@
+Q4515159
@@ Property / cites work: Q4515159 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Matching, Euler tours and the Chinese postman
@@ Property / cites work: Matching, Euler tours and the Chinese postman / rank @@
+Normal rank
@@ Property / cites work @@
+Sparsification—a technique for speeding up dynamic graph algorithms
+Normal rank
@@ Property / cites work @@
+Faster scaling algorithms for general graph matching problems
+Normal rank
@@ Property / cites work @@
+College Admissions and the Stability of Marriage
@@ Property / cites work: College Admissions and the Stability of Marriage / rank @@
+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 @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Q5743485
@@ Property / cites work: Q5743485 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic graph connectivity in polylogarithmic worst case time
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2004
@@ Property / cites work: Algorithms – ESA 2004 / 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 @@
+Cuckoo hashing
@@ Property / cites work: Cuckoo hashing / 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 @@
+Towards polynomial lower bounds for dynamic problems
+Normal rank
@@ Property / cites work @@
+Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
+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 @@
+Q2934589
@@ Property / cites work: Q2934589 / rank @@
+Normal rank
@@ Property / cites work @@
+Fully-dynamic min-cut
@@ Property / cites work: Fully-dynamic min-cut / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5252659