Preprint
Oct 2026
Eccentricity Shortest Path: the structural parameter landscape
The Eccentricity Shortest Path problem asks, given a connected graph and a nonnegative integer $R$, whether some shortest path is within distance $R$ of every vertex. We study its structural parameterized complexity. We give fixed-parameter algorithms for vertex-deletion distance to cographs, vertex-deletion distance t...
Anand Babu, Ashwin Jacob, Hitendra Kumar et al.
· 0 citations