Efficient Computation of Balanced Structures

  • David G. Harris
  • Ehab Morsy
  • Gopal Pandurangan
  • Peter Robinson
  • Aravind Srinivasan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7966)


Basic graph structures such as maximal independent sets (MIS’s) have spurred much theoretical research in distributed algorithms, and have several applications in networking and distributed computing as well. However, the extant (distributed) algorithms for these problems do not necessarily guarantee fault-tolerance or load-balance properties: For example, in a star-graph, the central vertex, as well as the set of leaves, are both MIS’s, with the latter being much more fault-tolerant and balanced — existing distributed algorithms do not handle this distinction. We propose and study “low-average degree” or “balanced” versions of such structures. Interestingly, in sharp contrast to, say, MIS’s, it can be shown that checking whether a structure is balanced, will take substantial time. Nevertheless, we are able to develop good sequential and distributed algorithms for such “balanced” versions. We also complement our algorithms with several lower bounds.


Greedy Algorithm Average Degree Balance Structure Minimal Vertex Cover Marked Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7(4), 567–583 (1986)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)Google Scholar
  3. 3.
    Gavinsky, D., Lovett, S., Saks, M., Srinivasan, S.: A tail bound for read-k families of functions. arXiv preprint arXiv:1205.1478 (2012)Google Scholar
  4. 4.
    Harris, D.G., Morsy, E., Pandurangan, G., Robinson, P., Srinivasan, A.: Efficient Computation of Balanced Structures,
  5. 5.
    Kuhn, F., Moscibroda, T., Wattenhofer, R.: Local computation: Lower and upper bounds. CoRR, abs/1011.5470 (2010)Google Scholar
  6. 6.
    Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036–1053 (1986)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Moscibroda, T.: Clustering. In: Algorithms for Sensor and Ad Hoc Networks, pp. 37–60 (2007)Google Scholar
  8. 8.
    Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM (2000)Google Scholar
  9. 9.
    Rajaraman, R.: Topology control and routing in ad hoc networks: a survey. SIGACT News 33(2), 60–73 (2002)CrossRefGoogle Scholar
  10. 10.
    Suomela, J.: Survey of local algorithms. ACM Comput. Surv. 45(2) (2013)Google Scholar
  11. 11.
    Zhang, H., Shen, H.: Balancing energy consumption to maximize network lifetime in data-gathering sensor networks. IEEE TPDS 20(10), 1526–1539 (2009)MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • David G. Harris
    • 1
  • Ehab Morsy
    • 2
    • 3
  • Gopal Pandurangan
    • 2
    • 4
  • Peter Robinson
    • 2
  • Aravind Srinivasan
    • 5
  1. 1.Department of Applied MathematicsUniversity of MarylandCollege ParkUSA
  2. 2.Division of Mathematical SciencesNanyang Technological UniversitySingapore
  3. 3.Department of MathematicsSuez Canal UniversityIsmailiaEgypt
  4. 4.Department of Computer ScienceBrown UniversityProvidenceUSA
  5. 5.Department of Computer Science and Institute for Advanced Computer StudiesUniversity of MarylandCollege ParkUSA

Personalised recommendations