2 papers
cs.DM2024
Parameterized Saga of First-Fit and Last-Fit Coloring
Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan +2
The classic greedy coloring (first-fit) algorithm considers the vertices of an input graph in a given order and assigns the first available color to each vertex in . In…
cs.DS2023
Parameterized algorithms for Eccentricity Shortest Path Problem
Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh +2
Given an undirected graph and an integer , the Eccentricity Shortest Path (ESP) asks to find a shortest path such that for every vertex , there is a…