An independent set of a graph is a subset of its vertices such that there are not any two adjacent vertices in this set. Finding the maximal independent set of a graph has many important applications such as clustering in wireless networks, and independent sets can also be used to build other graph structures. In this chapter, we describe rank-based, randomized, and self-stabilizing distributed algorithms to form maximal independent sets of graphs.




  1. 1.
    Alon N, Babai L, Itai A (1986) A fast and simple randomized parallel algorithm for the maximal independent set problem. J Algorithms 7(4):567–583 MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Basagni S (2001) Finding a maximal independent set in wireless networks. Telecommun Syst 18(1–3):155–168 MATHCrossRefGoogle Scholar
  3. 3.
    Goddard W, Hedetniemi ST, Jacobs DP, Srimani PK (2003) Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks. In: Proc int parallel and distributed processing symposium Google Scholar
  4. 4.
    Ikeda M, Kamei S, Kakugawa H (2002) A space-optimal self-stabilizing algorithm for the maximal independent set problem. In: Proc 3rd international conference on parallel and distributed computing, applications and technologies Google Scholar
  5. 5.
    Kuhn F, Moscibroda T, Wattenhofer R (2004) What cannot be computed locally! In: Proc 23rd ACM symposium on principles of distributed computing (PODC) Google Scholar
  6. 6.
    Lenzen C, Wattenhofer R (2011) MIS on trees. In: 30th ACM symposium on principles of distributed computing (PODC), pp 41–48 Google Scholar
  7. 7.
    Luby M (1986) A simple parallel algorithm for the maximal independent set problem. SIAM J Comput 15(4):1036–1053 MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Panconesi A, Srinivasan A (1996) On the complexity of distributed network decomposition. J Algorithms 20(2):356–374 MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Sanghavi S, Shah D, Willsky AS (2009) Message passing for maximum weight independent set. IEEE Trans Inf Theory 55(11):4822–4834 MathSciNetCrossRefGoogle Scholar
  10. 10.
    Schneider J, Wattenhofer R (2008) A log-star distributed maximal independent set algorithm for growth-bounded graphs. In: 27th ACM symposium on principles of distributed computing (PODC) Google Scholar
  11. 11.
    Shukla SK, Rosenkrantz DJ, Ravi SS (1995) Observations on self-stabilizing graph algorithms for anonymous networks. In: Proc 2nd workshop on self-stabilizing systems Google Scholar
  12. 12.
    Turau V (2007) Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler. Inf Process Lett 103(3):88–93 MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    Wattenhofer R Principles of distributed computing. Lecture notes, ETH Google Scholar

Copyright information

© Springer-Verlag London 2013

Authors and Affiliations

  • K. Erciyes
    • 1
  1. 1.Computer Engineering DepartmentIzmir UniversityUckuyular, IzmirTurkey

Personalised recommendations