Some simple distributed algorithms for sparse networks

@article{Panconesi2001SomeSD,
  title={Some simple distributed algorithms for sparse networks},
  author={A. Panconesi and R. Rizzi},
  journal={Distributed Computing},
  year={2001},
  volume={14},
  pages={97-100}
}
  • A. Panconesi, R. Rizzi
  • Published 2001
  • Computer Science, Engineering
  • Distributed Computing
  • Summary. We give simple, deterministic, distributed algorithms for computing maximal matchings, maximal independent sets and colourings. We show that edge colourings with at most $2\Delta-1$ colours, and maximal matchings can be computed within ${\cal O}(\log^* n + \Delta)$ deterministic rounds, where $\Delta$ is the maximum degree of the network. We also show how to find maximal independent sets and $(\Delta+1)$-vertex colourings within ${\cal O}(\log^* n + \Delta^2)$ deterministic rounds. All… CONTINUE READING

    Topics from this paper.

    Faster Deterministic Distributed Coloring Through Recursive List Coloring
    • F. Kuhn
    • Mathematics, Computer Science
    • 2020
    • 10
    • PDF
    Simple and Near-Optimal Distributed Coloring for Sparse Graphs
    • 14
    • PDF
    Improved deterministic distributed matching via rounding
    • 15
    • Highly Influenced
    • PDF
    Deterministic Distributed Matching: Simpler, Faster, Better
    • 10
    • PDF
    Distributed deterministic edge coloring using bounded neighborhood independence
    • 27
    • Highly Influenced
    • PDF
    Exact Bounds for Distributed Graph Colouring
    • 11
    • PDF
    Improved Deterministic Distributed Matching via Rounding
    • 14
    • PDF
    Distributed approximation algorithms for maximum matching in graphs and hypergraphs
    • 12
    • PDF
    Lower Bounds for Maximal Matchings and Maximal Independent Sets
    • 24
    • Highly Influenced
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 18 REFERENCES
    Locality in Distributed Graph Algorithms
    • 778
    • PDF
    Parallel Symmetry-Breaking in Sparse Graphs
    • 162
    • PDF
    Parallel symmetry-breaking in sparse graphs
    • 186
    Low diameter graph decompositions
    • 162
    • PDF
    Parallel ((Greek D)D+1)-Coloring of Constant-Degree Graphs
    • 40
    • Highly Influential
    Analysis of Approximate Algorithms for Edge-Coloring Bipartite Graphs
    • 10
    • PDF