Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Locality of Distributed Symmetry Breaking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free Bits, PCPs, and Nonapproximability---Towards Tight Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient distributed computation of distance sketches in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Verification and Hardness of Distributed Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Computation in Dynamic Networks via Random Walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Minimum Cut Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for local approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Distributed Complexity of Computing Maximal Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak models of distributed computing, with connections to modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal distributed all pairs shortest paths and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for maximal matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Communication Complexity of Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast distributed approximation algorithm for minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computation of the mode / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computation in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: What cannot be computed locally! / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of being near-sighted / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-time distributed dominating set approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of distributed graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient distributed source detection with limited bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed MST for constant diameter graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Distributed Approximate Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed approximate matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3539854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple distributed algorithms for sparse networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed approximation algorithms for weighted shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Distributed Network Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Algorithms for Network Diameter and Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and Analysis of Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of local algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Weighted Matching / rank
 
Normal rank

Revision as of 02:25, 24 July 2024

scientific article; zbMATH DE number 7276061
Language Label Description Also known as
English
Distributed Graph Algorithms and their Complexity: An Introduction
scientific article; zbMATH DE number 7276061

    Statements

    Distributed Graph Algorithms and their Complexity: An Introduction (English)
    0 references
    0 references
    19 November 2020
    0 references
    distributed algorithms
    0 references
    graph algorithms
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references