When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165): Difference between revisions

@@ label / en / label / en @@
+When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time
@@ Property / cites work @@
+A fast and simple randomized parallel algorithm for the maximal independent set problem
+Normal rank
@@ Property / cites work @@
+Q5743464
@@ Property / cites work: Q5743464 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized greedy matching. II
@@ Property / cites work: Randomized greedy matching. II / rank @@
+Normal rank
@@ Property / cites work @@
+Sublinear Algorithms for (Δ + 1) Vertex Coloring
@@ Property / cites work: Sublinear Algorithms for (Δ + 1) Vertex Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Fully dynamic maximal independent set with sublinear update time
+Normal rank
@@ Property / cites work @@
+Fully Dynamic Maximal Independent Set with Sublinear in <i>n</i> Update Time
+Normal rank
@@ Property / cites work @@
+Distributed deterministic edge coloring using bounded neighborhood independence
+Normal rank
@@ Property / cites work @@
+Distributed Graph Coloring: Fundamentals and Recent Developments
+Normal rank
@@ Property / cites work @@
+Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) Time
+Normal rank
@@ Property / cites work @@
+Fully Dynamic Maximal Matching in $O(\log n)$ Update Time
+Normal rank
@@ Property / cites work @@
+On a division property of consecutive integers
@@ Property / cites work: On a division property of consecutive integers / rank @@
+Normal rank
@@ Property / cites work @@
+Q3416248
@@ Property / cites work: Q3416248 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Caro-Wei bound for independent sets in graph streams
+Normal rank
@@ Property / cites work @@
+Randomized greedy matching
@@ Property / cites work: Randomized greedy matching / rank @@
+Normal rank
@@ Property / cites work @@
+Claw-free graphs---a survey
@@ Property / cites work: Claw-free graphs---a survey / rank @@
+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 @@
+An Improved Distributed Algorithm for Maximal Independent Set
+Normal rank
@@ Property / cites work @@
+Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
+Normal rank
@@ Property / cites work @@
+Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation
+Normal rank
@@ Property / cites work @@
+Q4633805
@@ Property / cites work: Q4633805 / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect matchings in o(             <i>n</i>             log             <i>n</i>             ) time in regular bipartite graphs
+Normal rank
@@ Property / cites work @@
+Streaming algorithms for independent sets in sparse hypergraphs
+Normal rank
@@ Property / cites work @@
+Wireless Scheduling with Power Control
@@ Property / cites work: Wireless Scheduling with Power Control / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed large independent sets in one round on bounded-independence graphs
+Normal rank
@@ Property / cites work @@
+Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
+Normal rank
@@ Property / cites work @@
+Q4250185
@@ Property / cites work: Q4250185 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast and simple randomized parallel algorithm for maximal matching
+Normal rank
@@ Property / cites work @@
+What cannot be computed locally!
@@ Property / cites work: What cannot be computed locally! / rank @@
+Normal rank
@@ Property / cites work @@
+MIS on trees
@@ Property / cites work: MIS on trees / rank @@
+Normal rank
@@ Property / cites work @@
+Local computation algorithms for graphs of non-constant degrees
+Normal rank
@@ Property / cites work @@
+Locality in Distributed Graph Algorithms
@@ Property / cites work: Locality in Distributed Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4344227
@@ Property / cites work: Q4344227 / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Deterministic Algorithms for Fully Dynamic Maximal Matching
+Normal rank
@@ Property / cites work @@
+Q5743463
@@ Property / cites work: Q5743463 / rank @@
+Normal rank
@@ Property / cites work @@
+Fully dynamic MIS in uniformly sparse graphs
@@ Property / cites work: Fully dynamic MIS in uniformly sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Distributed Network Decomposition
+Normal rank
@@ Property / cites work @@
+A log-star distributed maximal independent set algorithm for growth-bounded graphs
+Normal rank
@@ Property / OpenAlex ID @@
+W2975721026
@@ Property / OpenAlex ID: W2975721026 / rank @@
+Normal rank
@@ Property / title @@
+When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (English)
+Normal rank