Chen; I. Kanj; and W. Jia. (The Vertex Cover Problem The Vertex Cover Problem)
Revision as of 10:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({1.2738}^k+ kn)$ == Space Complexity == $O(poly(n))$ words (https://www.cs.lafayette.edu/~gexia/research/mfcs06.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2006 == Reference == https://www.cs.lafayette.edu/~gexia/research/mfcs06.pdf")
Time Complexity
$O({1.2738}^k+ kn)$
Space Complexity
$O(poly(n))$ words
(https://www.cs.lafayette.edu/~gexia/research/mfcs06.pdf)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2006