Brute force (backtracking search) (The Vertex Cover Problem The Vertex Cover Problem)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O({2}^k n^O({1})$)

Space Complexity

$O(k)$ words

(Just need to keep track of current subset being checked)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1940

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Brute_force_(backtracking_search)_(The_Vertex_Cover_Problem_The_Vertex_Cover_Problem)&oldid=47452"