Algorithms and complexity for geodetic sets on planar and chordal graphs

Dibyayan Chakraborty, Harmender Gahlawat, Bodhayan Roy

A set $S$ of vertices of a graph $G$ is a \emph{geodetic set} if every vertex of $G$ lies in a shortest path between some pair of vertices of $S$. The \textsc{Minimum Geodetic Set…