On the Complexity of Distributed Network Decomposition

@article{Panconesi1996OnTC,
  title={On the Complexity of Distributed Network Decomposition},
  author={Alessandro Panconesi and Aravind Srinivasan},
  journal={J. Algorithms},
  year={1996},
  volume={20},
  pages={356-374}
}
  • Alessandro Panconesi, Aravind Srinivasan
  • Published 1996
  • Mathematics, Computer Science
  • J. Algorithms
  • In this paper, we improve the bounds for computing a network decomposition distributively and deterministically. Our algorithm computes an (n?(n),n?(n))-decomposition innO(?(n))time, whereformula. As a corollary we obtain improved deterministic bounds for distributively computing several graph structures such as maximal independent sets and ?-vertex colorings. We also show that the class of graphs G whose maximum degree isnO(?(n))where ?(n)=1/log lognis complete for the task of computing a near… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 164 CITATIONS, ESTIMATED 89% COVERAGE

    On the complexity of local distributed graph problems

    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Distributed coloring algorithms for triangle-free graphs

    VIEW 3 EXCERPTS
    CITES BACKGROUND

    On the complexity of distributed graph coloring

    VIEW 1 EXCERPT
    CITES METHODS

    Fast Distributed Coloring Algorithms for Triangle-Free Graphs

    VIEW 2 EXCERPTS
    CITES METHODS & BACKGROUND

    Distributed algorithms for random graphs

    VIEW 3 EXCERPTS
    CITES METHODS

    Fair Maximal Independent Sets

    VIEW 1 EXCERPT

    FILTER CITATIONS BY YEAR

    1997
    2020

    CITATION STATISTICS

    • 15 Highly Influenced Citations

    • Averaged 16 Citations per year from 2018 through 2020