Distributed algorithms for random graphs (Q888436): Difference between revisions

@@ Property / cites work @@
+A fast and simple randomized parallel algorithm for the maximal independent set problem
+Normal rank
@@ Property / cites work @@
+Q4385084
@@ Property / cites work: Q4385084 / rank @@
+Normal rank
@@ Property / cites work @@
+Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
+Normal rank
@@ Property / cites work @@
+Deterministic Distributed Vertex Coloring in Polylogarithmic 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 @@
+Cliques in random graphs
@@ Property / cites work: Cliques in random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The diameter of sparse random graphs
@@ Property / cites work: The diameter of sparse random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic coin tossing with applications to optimal parallel list ranking
+Normal rank
@@ Property / cites work @@
+Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs
+Normal rank
@@ Property / cites work @@
+Q3122905
@@ Property / cites work: Q3122905 / rank @@
+Normal rank
@@ Property / cites work @@
+On the independence number of random graphs
@@ Property / cites work: On the independence number of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Arboricity and spanning-tree packing in random graphs with an application to load balancing
+Normal rank
@@ Property / cites work @@
+On the Concentration of the Domination Number of the Random Graph
+Normal rank
@@ Property / cites work @@
+Parallel Symmetry-Breaking in Sparse Graphs
@@ Property / cites work: Parallel Symmetry-Breaking in Sparse Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient distributed algorithm for constructing small dominating sets
+Normal rank
@@ Property / cites work @@
+Diameters of Random Graphs
@@ Property / cites work: Diameters of Random Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Constant-time distributed dominating set approximation
+Normal rank
@@ Property / cites work @@
+Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
+Normal rank
@@ Property / cites work @@
+A Simple Parallel Algorithm for the Maximal Independent Set Problem
+Normal rank
@@ Property / cites work @@
+On the Distributed Complexity of Computing Maximal Matchings
+Normal rank
@@ Property / cites work @@
+Some simple distributed algorithms for sparse networks
+Normal rank
@@ Property / cites work @@
+On the Complexity of Distributed Network Decomposition
+Normal rank
@@ Property / cites work @@
+Distributed Computing: A Locality-Sensitive Approach
+Normal rank
@@ Property / cites work @@
+On tree census and the giant component in sparse random graphs
+Normal rank
@@ Property / cites work @@
+The Diameter of Sparse Random Graphs
@@ Property / cites work: The Diameter of Sparse Random Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the domination number of a random graph
@@ Property / cites work: On the domination number of a random graph / rank @@
+Normal rank