Searcharxiv⌕ Search

arXiv subjects

Abhishek Sahu

Publications and source records attributed to Abhishek Sahu.

21 records · Page 2Linked to original sources

An Improved Exact Algorithm for Knot-Free Vertex Deletion

A knot $K$ in a directed graph $D$ is a strongly connected component of size at least two such that there is no arc $(u,v)$ with $u \in V(K)$ and $v\notin V(K)$. Given a directed graph $D=(V,E)$, we study Knot-Free Vertex Deletion (KFVD), where the goal is to remove the minimum number of vertices such that the resulting graph contains no knots. This problem naturally emerges from its application in deadlock resolution since knots are deadlocks in the OR-model of distributed computation. The fastest known exact algorithm in literature for KFVD runs in time $\mathcal{O}^\star(1.576^n)$. In this paper, we present an improved exact algorithm running in time $\mathcal{O}^\star(1.4549^n)$, where $n$ is the number of vertices in $D$. We also prove that the number of inclusion wise minimal knot-free vertex deletion sets is $\mathcal{O}^\star(1.4549^n)$ and construct a family of graphs with $Ω(1.4422^n)$ minimal knot-free vertex deletion sets

cs.DS↗

Parameterized Complexity of Maximum Edge Colorable Subgraph

A graph $H$ is {\em $p$-edge colorable} if there is a coloring $ψ: E(H) \rightarrow \{1,2,\dots,p\}$, such that for distinct $uv, vw \in E(H)$, we have $ψ(uv) \neq ψ(vw)$. The {\sc Maximum Edge-Colorable Subgraph} problem takes as input a graph $G$ and integers $l$ and $p$, and the objective is to find a subgraph $H$ of $G$ and a $p$-edge-coloring of $H$, such that $|E(H)| \geq l$. We study the above problem from the viewpoint of Parameterized Complexity. We obtain \FPT\ algorithms when parameterized by: $(1)$ the vertex cover number of $G$, by using {\sc Integer Linear Programming}, and $(2)$ $l$, a randomized algorithm via a reduction to \textsc{Rainbow Matching}, and a deterministic algorithm by using color coding, and divide and color. With respect to the parameters $p+k$, where $k$ is one of the following: $(1)$ the solution size, $l$, $(2)$ the vertex cover number of $G$, and $(3)$ $l - {\mm}(G)$, where ${\mm}(G)$ is the size of a maximum matching in $G$; we show that the (decision version of the) problem admits a kernel with $\mathcal{O}(k \cdot p)$ vertices. Furthermore, we show that there is no kernel of size $\mathcal{O}(k^{1-ε} \cdot f(p))$, for any $ε> 0$ and computable function $f$, unless $\NP \subseteq \CONPpoly$.

cs.DM↗

The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments

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 is known to be W[1]-hard in general directed graphs. In this paper, we initiate a systematic study on the parameterized complexity of the problem restricted to tournaments. We show that the problem is fixed-parameter tractable and admits a polynomial kernel when parameterized by the solution size $k$. In particular, we show that it can be solved in $2^{\mathcal{O}(k \log k)} n^{\mathcal{O}(1)}$ time and has a kernel with $\mathcal{O}(k)$ vertices. The primary ingredient in both these results is a min-max theorem that states that every tournament either contains $k$ arc-disjoint triangles or has a feedback arc set of size at most $6k$. Our belief is that this combinatorial result is of independent interest and could be useful in other problems related to cycles in tournaments.

cs.DS↗