Abhishek Sahu

collaborators

2 papers

cs.DM2020

Parameterized Complexity of Maximum Edge Colorable Subgraph

Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu +2

A graph $H$ is {\em $p$ -edge colorable} if there is a coloring $ψ : E (H) \to {1, 2, \dots, p}$ , such that for distinct $uv, v w \in E (H)$ , we have $ψ (uv) \neq = ψ (v w)$ . The {\sc…

cs.DS2018

The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments

R. Krithika, Abhishek Sahu, Saket Saurabh +1

Given a directed graph $D$ on $n$ vertices and a positive integer $k$ , the Arc-Disjoint Cycle Packing problem is to determine whether $D$ has $k$ arc-disjoint cycles. This problem…