Distributed graph algorithms and their complexity: an introduction
From MaRDI portal
Publication:5135263
Recommendations
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 732976 (Why is no real title available?)
- scientific article; zbMATH DE number 1179121 (Why is no real title available?)
- scientific article; zbMATH DE number 1559563 (Why is no real title available?)
- scientific article; zbMATH DE number 1839431 (Why is no real title available?)
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
- A fast and simple randomized parallel algorithm for maximal matching
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- A fast distributed approximation algorithm for minimum spanning trees
- A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction
- Aggregation in dynamic networks
- Constant-time distributed dominating set approximation
- Design and Analysis of Distributed Algorithms
- Distributed Computing: A Locality-Sensitive Approach
- Distributed MST for constant diameter graphs
- Distributed Weighted Matching
- Distributed algorithms for network diameter and girth
- Distributed approximate matching
- Distributed approximation algorithms for weighted shortest paths
- Distributed computation in dynamic networks
- Distributed computation of the mode
- Distributed minimum cut approximation
- Distributed verification and hardness of distributed approximation
- Efficient distributed computation of distance sketches in networks
- Efficient distributed source detection with limited bandwidth
- Fast distributed computation in dynamic networks via random walks
- Free Bits, PCPs, and Nonapproximability---Towards Tight Results
- Improved Distributed Approximate Matching
- Invitation to discrete mathematics
- Locality in Distributed Graph Algorithms
- Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
- Networks cannot compute their diameter in sublinear time
- On the Complexity of Distributed Network Decomposition
- On the complexity of distributed graph coloring
- On the distributed complexity of computing maximal matchings
- On the distributional complexity of disjointness
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Optimal distributed all pairs shortest paths and applications
- Some simple distributed algorithms for sparse networks
- Sublogarithmic distributed \textsc{MIS} algorithm for sparse graphs using Nash-Williams decomposition
- Survey of local algorithms
- The Probabilistic Communication Complexity of Set Intersection
- The locality of distributed symmetry breaking
- The price of being near-sighted
- Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem
- Weak models of distributed computing, with connections to modal logic
- What cannot be computed locally!
Cited in
(5)- An introductory tutorial to concurrency-related distributed recursion
- Reducing conflict resolution time for solving graph problems in broadcast communications
- Distributed processing of graphs: Fundamental cycles algorithm
- Distributed graph algorithms for computer networks
- Low-complexity distributed algorithms on large-scale graphs: a brief review
This page was built for publication: Distributed graph algorithms and their complexity: an introduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5135263)
