Results 1  10
of
15
FixedParameter Algorithms for Cluster Vertex Deletion
, 2008
"... We initiate the first systematic study of the NPhard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixedparameter algorithmics. In the unweighted case, one searches for a minimum number of vertex deletions to transform a graph into a collection of disjoint cliques. Th ..."
Abstract

Cited by 24 (13 self)
 Add to MetaCart
We initiate the first systematic study of the NPhard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixedparameter algorithmics. In the unweighted case, one searches for a minimum number of vertex deletions to transform a graph into a collection of disjoint cliques. The parameter is the number of vertex deletions. We present efficient fixedparameter algorithms for CVD applying the fairly new iterative compression technique. Moreover, we study the variant of CVD where the maximum number of cliques to be generated is prespecified. Here, we exploit connections to fixedparameter algorithms for (weighted) Vertex Cover.
Chordal deletion is fixedparameter tractable
 In 32nd International Workshop on GraphTheoretic Concepts in Computer Science, WG 2006, LNCS Proceedings
, 2004
"... Abstract. It is known to be NPhard to decide whether a graph can be made chordal by the deletion of k vertices. Here we present a uniformly polynomialtime algorithm for the problem: the running time is f(k) ·n α for some constant α not depending on k and some f depending only on k. For large value ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
Abstract. It is known to be NPhard to decide whether a graph can be made chordal by the deletion of k vertices. Here we present a uniformly polynomialtime algorithm for the problem: the running time is f(k) ·n α for some constant α not depending on k and some f depending only on k. For large values of n, such an algorithm is much better than trying all the O(n k) possibilities. Therefore, the chordal deletion problem parameterized by the number k of vertices to be deleted is fixedparameter tractable. This answers an open question of Cai [2]. 1
Algorithm Engineering for Optimal Graph Bipartization
, 2009
"... We examine exact algorithms for the NPhard Graph Bipartization problem. The task is, given a graph, to find a minimum set of vertices to delete to make it bipartite. Based on the “iterative compression ” method introduced by Reed, Smith, and Vetta in 2004, we present new algorithms and experimental ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
We examine exact algorithms for the NPhard Graph Bipartization problem. The task is, given a graph, to find a minimum set of vertices to delete to make it bipartite. Based on the “iterative compression ” method introduced by Reed, Smith, and Vetta in 2004, we present new algorithms and experimental results. The worstcase time complexity is improved. Based on new structural insights, we give a simplified correctness proof. This also allows us to establish a heuristic improvement that in particular speeds up the search on dense graphs. Our best algorithm can solve all instances from a testbed from computational biology within minutes, whereas established methods are only able to solve about half of the instances within reasonable time.
Fast FAST
"... Abstract. We present a randomized subexponential time, polynomial space parameterized algorithm for the kWeighted Feedback Arc Set in Tournaments (kFAST) problem. We also show that our algorithm can be derandomized by slightly increasing the running time. To derandomize our algorithm we construct ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
Abstract. We present a randomized subexponential time, polynomial space parameterized algorithm for the kWeighted Feedback Arc Set in Tournaments (kFAST) problem. We also show that our algorithm can be derandomized by slightly increasing the running time. To derandomize our algorithm we construct a new kind of universal hash functions, that we coin universal coloring families. For integers m, k and r, a family F of functions from [m] to [r] is called a universal (m, k, r)coloring family if for any graph G on the set of vertices [m] with at most k edges, there exists an f ∈ F which is a proper vertex coloring of G. Our algorithm is the first nontrivial subexponential time parameterized algorithm outside the framework of bidimensionality. 1
Iterative compression for exactly solving nphard minimization problems
 in Algorithmics of Large and Complex Networks, Lecture Notes in Computer Science
"... Abstract. We survey the conceptual framework and several applications of the iterative compression technique introduced in 2004 by Reed, Smith, and Vetta. This technique has proven very useful for achieving a number of recent breakthroughs in the development of fixedparameter algorithms for NPhard ..."
Abstract

Cited by 10 (9 self)
 Add to MetaCart
Abstract. We survey the conceptual framework and several applications of the iterative compression technique introduced in 2004 by Reed, Smith, and Vetta. This technique has proven very useful for achieving a number of recent breakthroughs in the development of fixedparameter algorithms for NPhard minimization problems. There is a clear potential for further applications as well as a further development of the technique itself. We describe several algorithmic results based on iterative compression and point out some challenges for future research. 1
Some Parameterized Problems on Digraphs
 The Computer Journal
"... We survey known results on parameterized complexity of the feedback set and induced subdigraph problems for digraphs. We prove new results on some parameterizations of the paired comparison problems on digraphs. One of our theorems implies a new result for a parameterized version of the linear arran ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We survey known results on parameterized complexity of the feedback set and induced subdigraph problems for digraphs. We prove new results on some parameterizations of the paired comparison problems on digraphs. One of our theorems implies a new result for a parameterized version of the linear arrangement problem for undirected graphs. We state several open problems. 1
Feedback Arc Set in Bipartite Tournaments is NPComplete
"... The Feedback Arc Set problem asks whether it is possible to delete at most k arcs to make a directed graph acyclic. We show that Feedback Arc Set is NPcomplete for bipartite tournaments, that is, directed graphs that are orientations of complete bipartite graphs. Key words: combinatorial problems, c ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The Feedback Arc Set problem asks whether it is possible to delete at most k arcs to make a directed graph acyclic. We show that Feedback Arc Set is NPcomplete for bipartite tournaments, that is, directed graphs that are orientations of complete bipartite graphs. Key words: combinatorial problems, computational complexity, feedback set problems, bipartite tournaments Given a directed graph G = (V, A) with vertex set V and arc set A, a feedback vertex (or arc) set is a subset of vertices (or arcs) that meets all cycles in G. The Feedback Vertex/Arc Set (FVS/FAS) problems ask to decide, for a given graph G and a nonnegative integer k, whether there is a feedback vertex/arc set of size at most k. Both problems are known to be NPcomplete if we put no restriction on the input directed graphs [3]. Motivated by the general hardness results, many subclasses of directed graphs have been considered. It turns out that both FVS and FAS can be solved in polynomial time in reducible flow graphs [10] and in cyclically reducible flow graphs [12]. Due to important applications, e.g. in voting systems [7], feedback set problems restricted to tournaments received considerable attention. A tournament is a directed graph where there is exactly one arc between each
Directed Feedback Vertex Set problem is
 FPT, Dagstuhl Seminar Series, Seminar 07281 (2007), available electornically at http://kathrin.dagstuhl.de/files/Materials/07/07281/ 07281.ChenJianer.Paper.pdf
"... Abstract. To decide if the parameterized feedback vertex set problem in directed graph is fixedparameter tractable is a long standing open problem. In this paper, we prove that the parameterized feedback vertex set in directed graph is fixedparameter tractable and give the first FPT algorithm of r ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. To decide if the parameterized feedback vertex set problem in directed graph is fixedparameter tractable is a long standing open problem. In this paper, we prove that the parameterized feedback vertex set in directed graph is fixedparameter tractable and give the first FPT algorithm of running time O((1.48k) k n O(1) ) for it. As the feedback arc set problem in directed graph can be transformed to a feedback vertex set problem in directed graph, hence we also show that the parameterized feedback arc set problem can be solved in time of O((1.48k) k n O(1)).
Directed Feedback Vertex Set is FixedParameter Tractable
"... Abstract. We resolve positively a long standing open question regarding the fixedparameter tractability of the parameterized Directed Feedback Vertex Set problem. In particular, we propose an algorithm which solves this problem in O(8 k k! ∗ poly(n)). Keywords. Directed Feedback Vertex Set, Fixed ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We resolve positively a long standing open question regarding the fixedparameter tractability of the parameterized Directed Feedback Vertex Set problem. In particular, we propose an algorithm which solves this problem in O(8 k k! ∗ poly(n)). Keywords. Directed Feedback Vertex Set, FixedParameter Tractability 1
Kernels for Feedback Arc Set In Tournaments
, 2009
"... A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, the Feedback Arc Set problem asks whether the given digraph has a set of k arcs whose removal results in an acyclic digraph ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, the Feedback Arc Set problem asks whether the given digraph has a set of k arcs whose removal results in an acyclic digraph. The Feedback Arc Set problem restricted to tournaments is known as the kFeedback Arc Set in Tournaments (kFAST) problem. In this paper we obtain a linear vertex kernel for kFAST. That is, we give a polynomial time algorithm which given an input instance T to kFAST obtains an equivalent instance T ′ on O(k) vertices. In fact, given any fixed ɛ> 0, the kernelized instance has at most (2 + ɛ)k vertices. Our result improves the previous known bound of O(k²) on the kernel size for kFAST. Our kernelization algorithm solves the problem on a subclass of tournaments in polynomial time and uses a known polynomial time approximation scheme for kFAST.