Parameterized Eulerian strong component arc deletion problem on tournaments
نویسندگان
چکیده
منابع مشابه
Parameterized Eulerian Strong Component Arc Deletion Problem on Tournaments
In the problemMin-DESC, we are given a digraphD and an integer k, and asked whether there exists a set A of at most k arcs inD, such that if we remove the arcs of A, in the resulting digraph every strong component is Eulerian. Min-DESC is NP-hard; Cechlárová and Schlotter (IPEC 2010) asked whether the problem is fixed-parameter tractable when parameterized by k. We consider the subproblem of Mi...
متن کاملStrong Parameterized Deletion: Bipartite Graphs
The purpose of this article is two fold: (a) to formally introduce a stronger version of graph deletion problems; and (b) to study this version in the context of bipartite graphs. Given a family of graphs F , a typical instance of parameterized graph deletion problem consists of an undirected graph G and a positive integer k and the objective is to check whether we can delete at most k vertices...
متن کامل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 ...
متن کاملFeedback Arc Set Problem in Bipartite Tournaments
In this paper we give ratio 4 deterministic and randomized approximation algorithms for the FEEDBACK ARC SET problem in bipartite tournaments. We also generalize these results to give a factor 4 deterministic approximation algorithm for FEEDBACK ARC SET problem in multipartite tournaments. © 2007 Elsevier B.V. All rights reserved.
متن کاملOn arc-traceable tournaments
A digraph D = (V, A) is arc-traceable if for each arc xy in A, xy lies on a directed path containing all the vertices of V , i.e. a hamiltonian path. Given a tournament T , it is well known that it contains a directed hamiltonian path. In this paper, we develop the structure necessary for a tournament T to contain an arc xy that is not on any hamiltonian path. Using this structure, we give suff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2012
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2011.11.014