Showing 2026 · cs.DSShow all
2 papers · 2 filters
cs.DS2026
Eccentricity Shortest Path: the structural parameter landscape
Anand Babu, Ashwin Jacob, Hitendra Kumar +1
The Eccentricity Shortest Path problem asks, given a connected graph and a nonnegative integer , whether some shortest path is within distance of every vertex. We study its…
cs.DS2026
The Complexity of Hamiltonian Cycles and Paths with Prescribed Walk Lengths
Hitendra Kumar, Mathieu Mari, R. B. Sandeep
Fix a set of positive integers. An -Hamiltonian cycle is a cyclic ordering of all vertices of a graph such that each consecutive pair is joined by a walk whose length belong…