A. Agrawal

collaborators

2 papers

cs.DS2025

Path Contraction Faster than $2^{n}$

Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov +2

A graph $G$ is contractible to a graph $H$ if there is a set $X \subseteq E (G)$ , such that $G / X$ is isomorphic to $H$ . Here, $G / X$ is the graph obtained from $G$ by contracting all…

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 $G$ in a given order and assigns the first available color to each vertex $v$ in $G$ . In…

Path Contraction Faster than 2n

Parameterized Saga of First-Fit and Last-Fit Coloring

Path Contraction Faster than $2^{n}$