4 papers · 1 filter
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…
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…
Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms
Ajinkya Gaikwad, Hitendra Kumar, S. Padmapriya +3
We study a family of graph modification problems called the F-Vertex Splitting problem. Given a graph G, the task is to determine whether G can be transformed into a graph G-prime…
Parameterized Algorithms for Editing to Uniform Cluster Graph
Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity
We study the parameterized complexity of transforming graphs into Uniform Cluster graphs, where each component is an equal-sized clique. We consider Uniform Cluster Vertex Deletion…