An optimal maximal independent set algorithm for bounded-independence graphs

Distributed Computing

Volumn 22, Issue 5-6, 2010, Pages 349-361

  Schneider, Johannes ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Ad Hoc network; Bounded independence graph; Coloring; Connected Dominating Set; Dominating set; Growth bounded graph; Local algorithm; Maximal independent set; Maximal matching; Parallel algorithm; Radio network; Sensor network; Symmetry breaking; Unit disk graph

Indexed keywords

AD HOC NETWORKS; COLORING; OPTIMIZATION; PARALLEL ALGORITHMS; SENSOR NETWORKS;

BOUNDED-INDEPENDENCE GRAPH; CONNECTED DOMINATING SET; DOMINATING SETS; LOCAL ALGORITHM; MAXIMAL INDEPENDENT SET; MAXIMAL MATCHINGS; RADIO NETWORKS; SYMMETRY-BREAKING; UNIT DISK GRAPHS;

ALGORITHMS;

EID: 84883539792     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-010-0097-1     Document Type: Article

References (25)

1. Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7(4), 567-583 (1986)
2. Alzoubi,K., Li,X.,Wang,Y.,Wan, P., Frieder, O.:Geometric spanners forwireless ad hoc Networks. IEEE Trans. ParallelDistributed Syst. 14(5), 408-421 (2003)
3. Andersson, A., Hagerup, T., Nilsson, S., Raman, R.: Sorting in linear time. J. Comput. Syst. Sci. 57, 74-93 (1998)
4. Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.A.: Network decomposition and locality in distributed computation. In: Proceedings of the 30th Symposium on Foundations of Computer Science (FOCS), pp. 364-369 (1989)
5. Awerbuch, B., Varghese, G.: Distributed program checking: A paradigm for building self-stabilizing distributed protocols. In: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science (FOCS) (1991)
6. Barenhoim, L., Elkin, M.: Sublogarithmic Distributed MIS Algorithm for Sparse Graphs using Nash-Williams Decomposition. In: Journal of Distributed Computing Special Issue of selected papers from PODC 2008 (2010)
7. Bonorden, O., Degener, B., Kempkes, B., Pietrzyk, P.: Complexity and approximation of a geometric local robot assignment problem. In: ALGOSENSORS (2009)
8. Cole, R., Vishkin, U.: Deterministic coin tossing with applications to optimal parallel list ranking. Inf. Control 70(1), 32-54 (1986)
9. Czygrinow,A., Hanckowiak,M.,Wawrzyniak,W.: Fast distributed approximations in planar graphs. In: DISC (2008)
10. Gfeller, B., Vicari, E.: A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs. In: Proceedings of the 26th ACM Symposium on Principles of Distributed Computing (PODC) (2007)
11. Goldberg, A., Plotkin, S., Shannon, G.: Parallel symmetry-breaking in sparse graphs. SIAM J. Discrete Math.(SIDMA) 1(4), 434-446 (1988)
12. Israeli, A., Itai, A.:Afast and simple randomized parallel algorithm for maximal matching. Inf. Process. Lett. 22, 77-80 (1986)
13. Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Fast deterministic distributed maximal independent set computation on growth-bounded graphs. In: Proceedings of the 19th International Symposium on Distributed Computing (DISC) (2005)
14. Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Local approximation schemes for ad hoc and sensor networks. In: Proceedings of the 3rdACMJointWorkshop on Foundations of Mobile Computing (DIALM-POMC) (2005)
15. Kuhn, F., Moscibroda, T., Wattenhofer, R.: On the locality of bounded growth. In: Proceedings of the 24th ACM Symposium on Principles of Distributed Computing (PODC), pp. 60-68 (2005)
16. Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally! In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 300-309 (2005)
17. Lenzen, C., Wattenhofer, R.: Leveraging linial's locality limit. In: 22nd International Symposium on Distributed Computing (DISC) September (2008)
18. Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193-201 (1992)
19. Luby, M.:Asimple parallel algorithm for themaximal independent set problem. SIAM J. Comput. 15, 1036-1053 (1986)
20. Panconesi, A., Srinivasan, A.: Improved distributed algorithms for coloring and network decomposition problems. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing (STOC), pp. 581-592. ACM Press (1992)
21. Pandit, S., Pemmaraju, S.: Finding facilities fast. In: Proceedings of the 10th International Conference on Distributed Computing and Networking (ICDCN) (2009)
22. Pirwani, I.A., Salavatipour, M.R.: A ptas for minimum clique partition in unit disk graphs. CoRR (2009)
23. Schneider J.,Wattenhofer, R.: A log-star distributed maximal independent set algorithm for growth-bounded graphs. In: 27th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, August (2008)
24. Schneider, J., Wattenhofer, R.: Coloring unstructured wireless multi-hop networks. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing (PODC) (2009)
25. Sterling, A.: Self-assembling systems are distributed systems. CoRR (2009)