A self-stabilizing algorithm for locating the center of Cartesian product of K2 and maximal outerplanar graphs
Halina Bielak, Michał Pańczyk
Citation: Position Papers of the 2014 Federated Conference on Computer Science and Information Systems, M. Ganzha, L. Maciaszek, M. Paprzycki (eds). ACSIS, Vol. 3, pages 93–99 (2014)
Abstract. Self-stabilizing algorithms model distributed systems and allow automatic re- covery of the system from transient failures. The center of a graph is the set of vertices with minimal eccentricity. In this paper we investigate the self-stabilizing algorithm for finding the center of Cartesian product of K2 and maximal outerplanar graphs.