Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
We propose a distributed algorithm for the maximal 2-packing set in a geometric outerplanar graph. The execution time of this algorithm is O(n) O ( n ) steps. The algorithm has three phases: leader election, graph exploration, and vertex coloring. The vertex coloring phase resembles an ear decomposition of the input graph. When the input graph is a ring, the algorithm computes the maximum 2-packing set.
distributed algorithm outerplanar graph 2-packing set ear decomposition geometric graph