collaborators

1 paper

cs.DM2019

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 of a graph is a \emph{geodetic set} if any vertex of…