Hardness and approximation for the geodetic set problem in some graph classes

Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat +2

In this paper, we study the computational complexity of finding the \emph{geodetic number} of graphs. A set of vertices $S$ of a graph $G$ is a \emph{geodetic set} if any vertex of…