Introduction to Algorithms
Dominating sets in planar graphs: branch-width and exponential speed-up
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Parameterized Algorithms for Planar Dominating Set
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Randomized algorithms for the loop cutset problem
Journal of Artificial Intelligence Research
An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem*
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Improved fixed-parameter algorithms for two feedback set problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
The undirected feedback vertex set problem has a poly(k) kernel
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized Complexity
A fixed-parameter algorithm for the directed feedback vertex set problem
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Improved algorithms for feedback vertex set problems
Journal of Computer and System Sciences
Parameterizing above or below guaranteed values
Journal of Computer and System Sciences
A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
A quartic kernel for pathwidth-one vertex deletion
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Subset feedback vertex set is fixed-parameter tractable
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Feedback vertex set in mixed graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Enumerating minimal subset feedback vertex sets
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Isomorphism for graphs of bounded feedback vertex set number
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
On feedback vertex set new measure and new structures
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
The Multivariate Algorithmic Revolution and Beyond
Improved algorithms for the feedback vertex set problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Feedback vertex set on graphs of low clique-width
European Journal of Combinatorics
An improved kernel for the undirected planar feedback vertex set problem
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
On group feedback vertex set parameterized by the size of the cutset
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.03 |
A feedback vertex set (fvs) of a graph is a set of vertices whose removal results in an acyclic graph. We show that if an undirected graph on n vertices with minimum degree at least 3 has a fvs on at most 1/3n1 − ε vertices, then there is a cycle of length at most 6/ε (for ε ≥ 1/2, we can even improve this to just 6).Using this, we obtain a O((12 log k/log log k + 6)k nω algorithm for testing whether an undirected graph on n vertices has a fvs of size at most k. Here nω is the complexity of the best matrix multiplication algorithm. The previous best parameterized algorithm for this problem took O((2k + 1)kn2) time.We also investigate the fixed parameter complexity of weighted feedback vertex set problem in weighted undirected graphs.