Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs

In this paper, we present a deterministic distributed algorithm that computes the maximal 2-packing set in a geometric outerplanar graph. In a geometric outerplanar graph, all the vertices have location coordinates in the plane and lie on the boundary of the graph. Our algorithm consists of three phases. First, it elects a vertex as the leader. Second, it explores the graph to determine relevant information about the structure of the input graph. Third, with this information, it computes a maximal 2-packing set. When the input graph is a ring, the algorithm computes a maximum 2-packing set. The execution time of this algorithm is O(n) steps and it uses O(nlogn) messages. This algorithm does not require knowledge of the size of the input graph. To the best of our knowledge, this is the first deterministic distributed algorithm that solves such a problem for a geometric outerplanar graph in a linear number of steps.

[1]  Volker Turau,et al.  Efficient transformation of distance-2 self-stabilizing algorithms , 2012, J. Parallel Distributed Comput..

[2]  Fredrik Manne,et al.  A Memory Efficient Self-stabilizing Algorithm for Maximal k -Packing , 2006, SSS.

[3]  Baruch Awerbuch,et al.  Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.

[4]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[5]  Jan Ramon,et al.  Frequent subgraph mining in outerplanar graphs , 2006, KDD '06.

[6]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[7]  János Pach.  Notes on Geometric Graph Theory , 1990, Discrete and Computational Geometry.

[8]  Roger Wattenhofer,et al.  An optimal maximal independent set algorithm for bounded-independence graphs , 2010, Distributed Computing.

[9]  Magnús M. Halldórsson,et al.  On colorings of squares of outerplanar graphs , 2004, SODA '04.

[10]  Martin Gairing,et al.  Self-Stabilizing Algorithms for {k}-Domination , 2003, Self-Stabilizing Systems.

[11]  Sridhar Radhakrishnan,et al.  An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing , 2000, IEEE Trans. Parallel Distributed Syst..

[12]  Aravind Srinivasan,et al.  On the Complexity of Distributed Network Decomposition , 1996, J. Algorithms.

[13]  Gerard Tel,et al.  Introduction to Distributed Algorithms: Contents , 2000 .

[14]  Fabian Kuhn.  Weak graph colorings: distributed algorithms and applications , 2009, SPAA '09.

[15]  Pawel Winter,et al.  Generalized Steiner Problem in Series-Parallel Networks , 1986, J. Algorithms.

[16]  Kathie Cameron,et al.  Finding a Strong Stable Set or a Meyniel Obstruction in any Graph , 2005 .

[17]  Andrew V. Goldberg,et al.  Network decomposition and locality in distributed computation , 1989, 30th Annual Symposium on Foundations of Computer Science.

[18]  Robert Geist,et al.  A Self-stabilizing Algorithm for Maximal 2-packing , 2004, Nord. J. Comput..

[19]  Jean-Sébastien Sereni,et al.  Toward more localized local algorithms: removing assumptions concerning global knowledge , 2011, PODC '11.

[20]  Zhengnan Shi,et al.  A self-stabilizing algorithm to maximal 2-packing with improved complexity , 2012, Inf. Process. Lett..

[21]  Jorge Urrutia,et al.  Route discovery with constant memory in oriented planar geometric networks , 2006 .

[22]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[23]  Joel Antonio Trejo-S'nchez,et al.  A Self-stabilizing Algorithm for the Maximal 2-packing in a Cactus Graph , 2012, IPDPS 2012.

[24]  Hao Jiang,et al.  A self-stabilizing algorithm for optimally efficient sets in graphs , 2012, Inf. Process. Lett..

[25]  Wayne Goddard,et al.  Distance- k knowledge in self-stabilizing algorithms , 2008, Theor. Comput. Sci..

[26]  Yung H. Tsin.  On finding an ear decomposition of an undirected graph distributively , 2004, Inf. Process. Lett..

[27]  Leonid Barenboim,et al.  Distributed (δ+1)-coloring in linear (in δ) time , 2009, STOC '09.

[28]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[29]  David B. Shmoys,et al.  A Best Possible Heuristic for the k-Center Problem , 1985, Math. Oper. Res..