The Maximum Mutual Visibility Set on a Cactus Graph and the Self-stabilizing Constructions

Yonghwan Kim, Yuichi Sudo

Given a graph $G=(V,E)$, let $S$ ($\subseteq V$) be a set of vertices. Two vertices are \emph{mutually visible} if there exists a shortest path in $G$ between them that does not co…