Efficient Computation of Balanced Structures
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.
KeywordsGreedy Algorithm Average Degree Balance Structure Minimal Vertex Cover Marked Vertex
Unable to display preview. Download preview PDF.
- 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.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.Harris, D.G., Morsy, E., Pandurangan, G., Robinson, P., Srinivasan, A.: Efficient Computation of Balanced Structures, http://static.monoid.at/balanced.pdf
- 5.Kuhn, F., Moscibroda, T., Wattenhofer, R.: Local computation: Lower and upper bounds. CoRR, abs/1011.5470 (2010)Google Scholar
- 7.Moscibroda, T.: Clustering. In: Algorithms for Sensor and Ad Hoc Networks, pp. 37–60 (2007)Google Scholar
- 8.Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM (2000)Google Scholar
- 10.Suomela, J.: Survey of local algorithms. ACM Comput. Surv. 45(2) (2013)Google Scholar