Parameterized Eulerian strong component arc deletion problem on tournaments

Authors:
R. Crowston;G. Gutin;M. Jones;A. Yeo
Affiliations:
Royal Holloway, University of London, United Kingdom;Royal Holloway, University of London, United Kingdom;Royal Holloway, University of London, United Kingdom;Royal Holloway, University of London, United Kingdom
Venue:
Information Processing Letters
Year:
2012

Citing 5
Cited 0

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Digraphs: Theory, Algorithms and Applications

Digraphs: Theory, Algorithms and Applications
Incompressibility through Colors and IDs

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On problems without polynomial kernels

Journal of Computer and System Sciences
Parameterized complexity of eulerian deletion problems

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

In the problem Min-DESC, 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. Min-DESC is NP-hard; Cechlarova and Schlotter (IPEC 2010) asked whether the problem is fixed-parameter tractable when parameterized by k. We consider the subproblem of Min-DESC when D is a tournament. We show that this problem is fixed-parameter tractable with respect to k.