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}
}
In this paper, we improve the bounds for computing a network decomposition Ž e Žn. e Žn.. distributively and deterministically. Our algorithm computes an n , n O Že Žn.. Ž . decomposition in n time, where e n s 1r log n . As a corollary we obtain ' improved deterministic bounds for distributively computing several graph structures such as maximal independent sets and D-vertex colorings. We also show that O Žd Žn.. Ž . the class of graphs G whose maximum degree is n where d n s 1rlog log n is… CONTINUE READING
Highly Influential
This paper has highly influenced 20 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 158 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

158 Citations

0102030'97'02'08'14
Citations per Year
Semantic Scholar estimates that this publication has 158 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 25 references

Fast network decomposition, in ‘‘Proceedings

  • B. Awerbuch, B. Berger, L. Cowen, D. Peleg
  • ACM Symposium on Principles of Distributed…
  • 1992

Fast deterministic constructions of low-diameter network decompositions, MIT-LCS

  • B. Berger, L. Cowen
  • Technical Memo 460,
  • 1991

Similar Papers

Loading similar papers…