Results 1  10
of
243
An FPT Algorithm for Set Splitting
 PROCEEDINGS 29TH WORKSHOP ON GRAPH THEORETIC CONCEPTS IN COMPUTER SCIENCE, SPRINGER VERLAG LNCS 2880
, 2003
"... An FPT algorithm with a running time of O(n is described for the Set Splitting problem, parameterized by the number k of sets to be split. It is also shown that there can be no FPT unless the satisfiability of nvariable 3SAT instances can be decided in time . ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
An FPT algorithm with a running time of O(n is described for the Set Splitting problem, parameterized by the number k of sets to be split. It is also shown that there can be no FPT unless the satisfiability of nvariable 3SAT instances can be decided in time .
A faster fpt algorithm for bipartite contraction
 CORR
"... The Bipartite Contraction problem is to decide, given a graph G and a parameter k, whether we can can obtain a bipartite graph from G by at most k edge contractions. The fixedparameter tractability of the problem was shown by Heggernes et al. [13], with an algorithm whose running time has doublee ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
exponential dependence on k. We present a new randomized FPT algorithm for the problem, which is both conceptually simpler and achieves an improved 2O(k 2)nm running time, i.e., avoiding the doubleexponential dependence on k. The algorithm can be derandomized using standard techniques.
PlanarF Deletion: Approximation and Optimal FPT Algorithms
"... Let F be a finite set of graphs. In the FDeletion problem, we are given an nvertex, medge graph G and an integer k as input, and asked whether at most k vertices can be deleted from G such that the resulting graph does not contain a graph from F as a minor. FDeletion is a generic problem and by ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
applicability beyond the scope of this paper. Our results – constant factor approximation and FPT algorithms – are stringed together by a common theme of polynomial time preprocessing. 1
Halfintegrality, LPbranching and FPT Algorithms
, 2014
"... A recent trend in parameterized algorithms is the application of polytope tools (specifically, LPbranching) to FPT algorithms (e.g., Cygan et al., 2011; Narayanaswamy et al., 2012). Though the list of work in this direction is short, the results are already interesting, yielding significant speedup ..."
Abstract
 Add to MetaCart
A recent trend in parameterized algorithms is the application of polytope tools (specifically, LPbranching) to FPT algorithms (e.g., Cygan et al., 2011; Narayanaswamy et al., 2012). Though the list of work in this direction is short, the results are already interesting, yielding significant
Bidimensionality: New Connections between FPT Algorithms and PTASs
, 2005
"... We demonstrate a new connection between fixedparametertractability and approximation algorithms for combinatorial optimization problems on planar graphs and their generalizations. Specifically, we extend the theory of socalled "bidimensional " problems to show that essentially ..."
Abstract

Cited by 43 (7 self)
 Add to MetaCart
We demonstrate a new connection between fixedparametertractability and approximation algorithms for combinatorial optimization problems on planar graphs and their generalizations. Specifically, we extend the theory of socalled "bidimensional " problems to show that essentially
FPT Algorithms and Kernels for the Directed kLeaf Problem
, 2008
"... A subgraph T of a digraph D is an outbranching if T is an oriented spanning tree with only one vertex of indegree zero (called the root). The vertices of T of outdegree zero are leaves. In the Directed kLeaf Problem, we are given a digraph D and an integral parameter k, and we are to decide whet ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
whether D has an outbranching with at least k leaves. Recently, Kneis et al. (2008) obtained an algorithm for the problem of running time 4 k · n O(1). We describe a new algorithm for the problem of running time 3.72 k · n O(1). In Rooted Directed kLeaf Problem, apart from D and k, we are given a vertex
FPT algorithms for connected feedback vertex set
 In Proc. WALCOM 2010
, 2010
"... Abstract. We study the recently introduced Connected Feedback Vertex Set (CFVS) problem from the viewpoint of parameterized algorithms. CFVS is the connected variant of the classical Feedback Vertex Set problem and is defined as follows: given a graph G = (V, E) and an integer k, decide whether th ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Abstract. We study the recently introduced Connected Feedback Vertex Set (CFVS) problem from the viewpoint of parameterized algorithms. CFVS is the connected variant of the classical Feedback Vertex Set problem and is defined as follows: given a graph G = (V, E) and an integer k, decide whether
An FPT Algorithm for Directed Spanning kLeaf
 PREPRINT 0462007, COMBINATORIAL OPTIMIZATION & GRAPH ALGORITHMS GROUP
, 2007
"... An outbranching of a directed graph is a rooted spanning tree with all arcs directed outwards from the root. We consider the problem of deciding whether a given digraph D has an outbranching with at least k leaves (Directed Spanning kLeaf). We prove that this problem is fixed parameter tractable, ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
an outbranching with at least k leaves exists, or a path decomposition with width O(k 3) can be found. This enables a dynamic programming based algorithm of running time 2 O(k3 log k) · n O(1), where n = V (D).
Results 1  10
of
243