Brief announcement: fair maximal independent sets in trees

Authors:
Jeremy Fineman;Calvin Newport;Tonghe Wang
Affiliations:
Georgetown University, Washington, DC, USA;Georgetown University, Washington, DC, USA;Georgetown University, Washington, DC, USA
Venue:
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Year:
2013

Citing 3
Cited 0

A simple parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
MIS on trees

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The Locality of Distributed Symmetry Breaking

FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finding a maximal independent set (MIS) is a classic problem in graph theory that has been widely study in the context of distributed algorithms. Standard distributed MIS solutions focus on time complexity. Here we focus on a novel attribute, fairness, where we consider an MIS algorithm fair if all nodes have similar probabilities of joining the set. In many contexts, fairness is important because a node's election to the MIS can have an impact on the resources it consumes. This paper addresses fairness by providing a provably fair and efficient distributed MIS algorithm for unrooted trees. The algorithm runs in O(logn) time and guarantees a correct MIS such that each node enters the set with probability at least 1/4 - ε, for arbitrarily small ε.