Hitting Geodesic Intervals in Structurally Restricted Graphs

Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada +2

Given a graph $G=(V,E)$, a set $T$ of vertex pairs, and an integer $k$, Hitting Geodesic Intervals asks whether there is a set $S\subseteq V$ of size at most $k$ such that for e…