Exact Algorithms
The corresponding NP optimization problem of finding the size of a minimum feedback vertex set can be solved in time O(1.7347n), where n is the number of vertices in the graph. This algorithm actually computes a maximum induced forest, and when such a forest is obtained, its complement is a minimum feedback vertex set. The number of minimal feedback vertex sets in a graph is bounded by O(1.8638n). The directed feedback vertex set problem can still be solved in time O*(1.9977n), where n is the number of vertices in the given directed graph. The parameterized versions of the directed and undirected problems are both fixed-parameter tractable.
Read more about this topic: Feedback Vertex Set
Famous quotes containing the word exact:
“Men are qualified for civil liberty in exact proportion to their disposition to put moral chains upon their own appetites; in proportion as their love to justice is above their rapacity; in proportion as their soundness and sobriety of understanding is above their vanity and presumption; in proportion as they are more disposed to listen to the counsels of the wise and good, in preference to the flattery of knaves.”
—Edmund Burke (1729–1797)