Improved algorithms for the feedback vertex set problems

Authors:
Jianer Chen;Fedor V. Fomin;Yang Liu;Songjian Lu;Yngve Villanger
Affiliations:
Department of Computer Science, Texas A&M University, College Station, Texas;Department of Informatics, University of Bergen, Bergen, Norway;Department of Computer Science, Texas A&M University, College Station, Texas;Department of Computer Science, Texas A&M University, College Station, Texas;Department of Informatics, University of Bergen, Bergen, Norway
Venue:
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Year:
2007

Citing 13
Cited 11

Fixed-parameter tractability and completeness III: some structural aspects of the W hierarchy

Complexity theory
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem

SIAM Journal on Discrete Mathematics
Introduction to algorithms

Introduction to algorithms
Operating System Concepts, 4th Ed.

Operating System Concepts, 4th Ed.
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and 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
Randomized algorithms for the loop cutset problem

Journal of Artificial Intelligence Research
Exact computation of maximum induced forest

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
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
Finding a minimum feedback vertex set in time O(1.7548n)

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Finding odd cycle transversals

Operations Research Letters
Parameterized Complexity

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
A fixed-parameter algorithm for the directed feedback vertex set problem

Journal of the ACM (JACM)
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
Iterative Compression for Exactly Solving NP-Hard Minimization Problems

Algorithmics of Large and Complex Networks
Almost 2-SAT is fixed-parameter tractable

Journal of Computer and System Sciences
Minimum fill-in and treewidth of split+ke and split+kv graphs

Discrete Applied Mathematics
Exact algorithms for maximum acyclic subgraph on a superclass of cubic graphs

WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
A linear kernel for planar feedback vertex set

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
FPT algorithms for connected feedback vertex set

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5kkn2). The algorithms construct a feedback vertex set of size bounded by k (in the weighted case this set is of minimum weight among the feedback vertex set of size at most k) in a given graph G, or reports that no such a feedback vertex set exists in G.