JUCS - Journal of Universal Computer Science 20(14): 1951-1963, doi: 10.3217/jucs-020-14-1951
A Self-stabilizing Algorithm for Locating the Center of Maximal Outerplanar Graphs
expand article infoMichal Pańczyk‡, Halina Bielak‡
‡ Maria Curie-Sklodowska University, Lublin, Poland

Corresponding author: Michal Pańczyk ( mjpanczyk@gmail.com )

© Michal Pańczyk, Halina Bielak.
This article is freely available under the J.UCS Open Content License.
Citation: Pańczyk M, Bielak H (2014) A Self-stabilizing Algorithm for Locating the Center of Maximal Outerplanar Graphs. JUCS - Journal of Universal Computer Science 20(14): 1951-1963. https://doi.org/10.3217/jucs-020-14-1951
Open Access
Abstract
Self-stabilizing algorithms model distributed systems, which automatically recover from transient failures in the state of the system. The center of a graph comprises a set of vertices with minimum eccentricity. Farley and Proskurowski showed the linear time algorithm for locating the center of an outerplanar graph in the classical computing paradigm. The present paper investigates the selfstabilizing algorithm for finding the center of maximal outerplanar graphs, using a new approach with dual trees.
Keywords
self-stabilization, outerplanar graph, center of a graph