Algorithms and Hardness for Geodetic Set on Tree-like Digraphs

Florent Foucaud, Narges Ghareghani, Lucas Lorieau +3

In the GEODETIC SET problem, an input is a (di)graph $G$ and integer $k$, and the objective is to decide whether there exists a vertex subset $S$ of size $k$ such that any vertex i…