PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Parameterized eulerian strong component arc deletion problem on tournaments
R. Crowston, G. Gutin, M. Jones and A. Yeo
Inform. Proc. Lett. Volume 112, pp. 249-251, 2012.

Abstract

In the problem \OurProb, we are given a digraph $D$ and an integer $k$, and asked whether there exists a set $A'$ of at most $k$ arcs in $D$, such that if we remove the arcs of $A'$, in the resulting digraph every strong component is Eulerian. \OurProb{} is \NPh; Cechl\'{a}rov\'{a} and Schlotter (IPEC 2010) asked whether the problem is fixed-parameter tractable when parameterized by $k$. We consider the subproblem of \OurProb{} when $D$ is a tournament. We show that this problem is fixed-parameter tractable with respect to $k$.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:9324
Deposited By:Gregory Gutin
Deposited On:16 March 2012