Brute force (backtracking search) (The Vertex Cover Problem The Vertex Cover Problem): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 11:5311:53, 15 February 2023‎ Admin talk contribs‎ 315 bytes +315‎ Created page with "== Time Complexity == $O({2}^k n^O({1})$) == Space Complexity == $O(k)$ auxiliary 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/wiki/Brute_force_(backtracking_search)_(The_Vertex_Cover_Problem_The_Vertex_Cover_Problem)"