TY - GEN
T1 - Efficient computation of balanced structures
AU - Harris, David G.
AU - Morsy, Ehab
AU - Pandurangan, Gopal
AU - Robinson, Peter
AU - Srinivasan, Aravind
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84880308818&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84880308818&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-39212-2_51
DO - 10.1007/978-3-642-39212-2_51
M3 - Conference contribution
AN - SCOPUS:84880308818
SN - 9783642392115
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 581
EP - 593
BT - Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings
T2 - 40th International Colloquium on Automata, Languages, and Programming, ICALP 2013
Y2 - 8 July 2013 through 12 July 2013
ER -