Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Improved exact exponential algorithms for vertex bipartization and other problems
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Measure and conquer: domination – a case study
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Enumerating maximal independent sets with applications to graph colouring
Operations Research Letters
An exact algorithm for the minimum dominating clique problem
Theoretical Computer Science
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
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
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
Exact algorithms for edge domination
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
Exact and parameterized algorithms for edge dominating set in 3-degree graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Enumerating minimal subset feedback vertex sets
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Exact algorithm for the maximum induced planar subgraph problem
ESA'11 Proceedings of the 19th European conference on Algorithms
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
Algorithms and constraint programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
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
Solving connected dominating set faster than 2n
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
On feedback vertex set new measure and new structures
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
An exact algorithm for the minimum dominating clique problem
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Finding a minimum feedback vertex set in time O(1.7548n)
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
Finding a maximum induced degenerate subgraph faster than 2n
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
| Hi-index | 0.01 |
We propose a backtrack algorithm that solves a generalized version of the Maximum Induced Forest problem (MIF) in time O*(1.8899n). The MIF problem is complementary to finding a minimum Feedback Vertex Set (FVS), a well-known intractable problem. Therefore the proposed algorithm can find a minimum FVS as well. To the best of our knowledge, this is the first algorithm that breaks the O*(2n) barrier for the general case of FVS. Doing the analysis, we apply a more sophisticated measure of the problem size than the number of nodes of the underlying graph