Results 1 
6 of
6
FixedParameter Tractability Results for Feedback Set Problems in Tournaments
 JOURNAL OF DISCRETE ALGORITHMS
, 2009
"... Complementing recent progress on classical complexity and polynomialtime approximability of feedback set problems in (bipartite) tournaments, we extend and improve fixedparameter tractability results for these problems. We show that Feedback Vertex Set in tournaments (FVST) is amenable to the nove ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
Complementing recent progress on classical complexity and polynomialtime approximability of feedback set problems in (bipartite) tournaments, we extend and improve fixedparameter tractability results for these problems. We show that Feedback Vertex Set in tournaments (FVST) is amenable to the novel iterative compression technique, and we provide a depthbounded search tree for Feedback Arc Set in bipartite tournaments based on a new forbidden subgraph characterization. Moreover, we apply the iterative compression technique to dHitting Set, which generalizes Feedback Vertex Set in tournaments, and obtain improved upper bounds for the time needed to solve 4Hitting Set and 5Hitting Set. Using our parameterized algorithm for Feedback Vertex Set in tournaments, we also give an exact (not parameterized) algorithm for it running in O(1.709 n) time, where n is the number of input graph vertices, answering a question of Woeginger [Discrete Appl. Math. 156(3):397–405, 2008].
Parameterized Algorithms for Directed Maximum Leaf Problems
 Proc. ICALP 2007, LNCS 4596
, 2007
"... Abstract. We prove that finding a rooted subtree with at least k leaves in a digraph is a fixed parameter tractable problem. A similar result holds for finding rooted spanning trees with many leaves in digraphs from a wide family L that includes all strong and acyclic digraphs. This settles complete ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
Abstract. We prove that finding a rooted subtree with at least k leaves in a digraph is a fixed parameter tractable problem. A similar result holds for finding rooted spanning trees with many leaves in digraphs from a wide family L that includes all strong and acyclic digraphs. This settles completely an open question of Fellows and solves another one for digraphs in L. Our algorithms are based on the following combinatorial result which can be viewed as a generalization of many results for a ‘spanning tree with many leaves ’ in the undirected case, and which is interesting on its own: If a digraph D ∈ L of order n with minimum indegree at least 3 contains a rooted spanning tree, then D contains one with at least (n/2) 1/5 − 1 leaves. 1
Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems
"... Abstract. There are different ways for an external agent to influence the outcome of an election. We concentrate on “control ” by adding or deleting candidates of an election. Our main focus is to investigate the parameterized complexity of various control problems for different voting systems. To t ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Abstract. There are different ways for an external agent to influence the outcome of an election. We concentrate on “control ” by adding or deleting candidates of an election. Our main focus is to investigate the parameterized complexity of various control problems for different voting systems. To this end, we introduce natural digraph problems that may be of independent interest. They help in determining the parameterized complexity of control for different voting systems including Llull, Copeland, and plurality votings. Devising several parameterized reductions, we provide a parameterized complexity overview of the digraph and control problems with respect to natural parameters. 1
On Making Directed Graphs Transitive
, 2010
"... We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to make a given digraph transitive by a minimum number of arc insertions or deletions. Transitivity Editing has recently been identified as important for the detection of hierarchi ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to make a given digraph transitive by a minimum number of arc insertions or deletions. Transitivity Editing has recently been identified as important for the detection of hierarchical structure in molecular characteristics of disease. We present a first proof of NPhardness, which also extends to the restricted cases where the input digraph is acyclic or has maximum degree three. Moreover, we improve previous fixedparameter algorithms, now achieving a running time of O(2.57 k + n 3) for an nvertex digraph if k arc modifications are sufficient to make it transitive. By providing an O(k 2)vertex problem kernel, we also answer an open question from the literature. In case of digraphs with maximum degree d, an O(k ·d)vertex problem kernel can be shown. We also demonstrate that if the input digraph does not contain “diamonds”, then there is an optimal solution that performs only arc deletions. Our hardness as well as algorithmic results transfer to Transitivity Deletion, where only arc deletions are allowed.
Spanning directed trees with many leaves
 SIAM J. Discrete Math
"... Abstract. The Directed Maximum Leaf OutBranching problem is to find an outbranching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this paper, we obtain two combinatorial results on the number of leaves in outbranchings. We show that – every strong ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Abstract. The Directed Maximum Leaf OutBranching problem is to find an outbranching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this paper, we obtain two combinatorial results on the number of leaves in outbranchings. We show that – every strongly connected nvertex digraph D with minimum indegree at least 3 has an outbranching with at least (n/4) 1/3 − 1 leaves; – if a strongly connected digraph D does not contain an outbranching with k leaves, then the pathwidth of its underlying graph UG(D) is O(k log k). Moreover, if the digraph is acyclic, the pathwidth is at most 4k. The last result implies that it can be decided in time 2 O(k log2 k) · n O(1) whether a strongly connected digraph on n vertices has an outbranching with at least k leaves. On acyclic digraphs the running time of our algorithm is 2 O(k log k) · n O(1). 1
Parameterized approximability of the disjoint cycle problem
 Proc. ICALP 2007, Lecture Notes in Computer Science
, 2007
"... Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm constructs a family of at least k/ρ(k) disjoint cycles of G if the graph G has a family of at least k disjoint cycles (and ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm constructs a family of at least k/ρ(k) disjoint cycles of G if the graph G has a family of at least k disjoint cycles (and otherwise may still produce a solution, or just report failure). Here ρ is a computable function such that k/ρ(k) is nondecreasing and unbounded. The running time of our algorithm is polynomial. The directed vertex disjoint cycle problem is hard for the parameterized complexity class W[1], and to the best of our knowledge our algorithm is the first fpt approximation algorithm for a natural W[1]hard problem. Key words: approximation algorithms, fixedparameter tractability, parameterized complexity theory. 1