SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
New upper bounds for maximum satisfiability
Journal of Algorithms
Refined Search Tree Technique for DOMINATING SET on Planar Graphs
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Upper Bounds for MaxSat: Further Improved
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Using Nondeterminism to Design Deterministic Algorithms
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Vertex Cover: Further Observations and Further Improvements
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Randomized algorithms for the loop cutset problem
Journal of Artificial Intelligence Research
Upper bounds for vertex cover further improved
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Parameterized Complexity
Parameterized algorithms for feedback set problems and their duals in tournaments
Theoretical Computer Science - Parameterized and exact computation
Faster fixed parameter tractable algorithms for finding feedback vertex sets
ACM Transactions on Algorithms (TALG)
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
Journal of Computer and System Sciences
Improved algorithms for feedback vertex set problems
Journal of Computer and System Sciences
A quadratic kernel for feedback vertex set
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
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 4k2 kernel for feedback vertex set
ACM Transactions on Algorithms (TALG)
A cubic kernel for feedback vertex set
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
A linear kernel for planar feedback vertex set
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
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
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
On feedback vertex set new measure and new structures
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Finding a minimum feedback vertex set in time O(1.7548n)
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
The undirected feedback vertex set problem has a poly(k) kernel
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Improved algorithms for the feedback vertex set problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
We give a O(max{12k, (4 lg k)k} 驴 n驴) algorithm for testing whether an undirected graph on n vertices has a feedback vertex set of size at most k where O(n驴) is the complexity of the best matrix multiplication algorithm. The previous best fixed parameter tractable algorithm for the problem took O((2k + 1)k n2) time. The main technical lemma we prove and use to develop our algorithm is that that there exists a constant c such that, if an undirected graph on n vertices with minimum degree 3 has a feedback vertex set of size at most c驴n, then the graph will have a cycle of length at most 12. This lemma may be of independent interest.We also show that the feedback vertex set problem can be solved in O(dk kn) for some constant d in regular graphs, almost regular graphs and (fixed) bounded degree graphs.