„Distributed graph algorithms“
Suchergebnisse
148 Treffer
-
Towards Distributed Two-Stage Stochastic Optimization
-
Distributed Optimization And Approximation: How Difficult Can It Be? (Keynote Abstract)
-
Low Diameter Graph Decompositions by Approximate Distance Computation
-
Step-By-Step Community Detection in Volume-Regular Graphs
-
Low-Congestion Shortcut and Graph Parameters
-
Improved Network Decompositions Using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond
-
Message Reduction in the LOCAL Model Is a Free Lunch
-
Distributed Algorithms for Low Stretch Spanning Trees
-
Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs
-
Distributed Arboricity-Dependent Graph Coloring via All-to-All Communication
-
Distributed Reconfiguration of Maximal Independent Sets
-
The Sparsest Additive Spanner via Multiple Weighted BFS Trees
-
Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs
-
Congested Clique Algorithms for Graph Spanners
-
Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds
-
Faster Distributed Shortest Path Approximations via Shortcuts
-
New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms
-
Distributed Approximate Maximum Matching in the CONGEST Model
-
(Delta+1) Coloring in the Congested Clique Model
-
Simple and Near-Optimal Distributed Coloring for Sparse Graphs