Finding a minimum feedback vertex set in time O(1.7548n)

Authors:
Fedor V. Fomin;Serge Gaspers;Artem V. Pyatkin
Affiliations:
Department of Informatics, University of Bergen, Bergen, Norway;Department of Informatics, University of Bergen, Bergen, Norway;Department of Informatics, University of Bergen, Bergen, Norway
Venue:
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Year:
2006

Citing 5
Cited 15

Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Measure and conquer: a simple O(20.288n) independent set algorithm

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
Parameterized complexity of generalized vertex cover problems

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures

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
Towards a theory for securing time synchronization in wireless sensor networks

Proceedings of the second ACM conference on Wireless network security
Iterative Compression for Exactly Solving NP-Hard Minimization Problems

Algorithmics of Large and Complex Networks
A 4k2 kernel for feedback vertex set

ACM Transactions on Algorithms (TALG)
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
A moderately exponential time algorithm for full degree spanning tree

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
A Tabu search heuristic based on k-diamonds for the weighted feedback vertex set problem

INOC'11 Proceedings of the 5th international conference on Network optimization
Fast exponential algorithms for maximum γ-regular induced subgraph problems

FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On feedback vertex set new measure and new structures

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Polynomial space algorithms for counting dominating sets and the domatic number

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Improved algorithms for the feedback vertex set problems

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Branch and recharge: exact algorithms for generalized domination

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an $\mathcal{O} (1.7548^n)$ algorithm finding a minimum feedback vertex set in a graph on n vertices.