Sriram Bhyravarapu

collaborators

2 papers

cs.DS2023

Parameterized algorithms for Eccentricity Shortest Path Problem

Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh +2

Given an undirected graph $G = (V, E)$ and an integer $ℓ$ , the Eccentricity Shortest Path (ESP) asks to find a shortest path $P$ such that for every vertex $v \in V (G)$ , there is a…

math.CO2021

Conflict-free coloring on open neighborhoods of claw-free graphs

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew

The `Conflict-Free Open (Closed) Neighborhood coloring', abbreviated CFON (CFCN) coloring, of a graph $G$ using $r$ colors is a coloring of the vertices of $G$ such that every vert…