Efficient computation of balanced structures

  • Authors:

  • David G. Harris;Ehab Morsy;Gopal Pandurangan;Peter Robinson;Aravind Srinivasan

  • Affiliations:

  • Department of Applied Mathematics, University of Maryland, College Park, MD;Division of Mathematical Sciences, Nanyang Technological University, Singapore,Department of Mathematics, Suez Canal University, Ismailia, Egypt;Division of Mathematical Sciences, Nanyang Technological University, Singapore,Department of Computer Science, Brown University, Providence, RI;Division of Mathematical Sciences, Nanyang Technological University, Singapore;Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD

  • Venue:
  • ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.