Chen; I. Kanj; and W. Jia. (The Vertex Cover Problem The Vertex Cover Problem): Difference between revisions

Revision as of 08:46, 10 April 2023

$O({1.2738}^k+ kn)$

$O(poly(n))$ words

Exact

No, deterministic

Word RAM

2006

@@ Line 1: / Line 1: @@
 == Time Complexity ==
-$O(kn + {1.2852}^k)$
+$O({1.2738}^k+ kn)$
 == Space Complexity ==
-$O(k^{3})$ auxiliary? (potentially $O(k^{2})$??) words
+$O(poly(n))$ words
-(First auxiliary graph contains O(k^2) edges; algorithm subsequently branches to a depth of O(k) (each fork being degree O(1)), with a new O(k^2)-sized graph at each depth. Interleaving shouldn't increase space usage asymptotically. (Could possibly be reduced to O(k) by just keeping track of graph deltas?) (but also a different source claims exponential?))
+(https://www.cs.lafayette.edu/~gexia/research/mfcs06.pdf)
 == Description ==
@@ Line 27: / Line 27: @@
 == Year ==
 == Reference ==
-https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.7.4800&rep=rep1&type=pdf
+https://www.cs.lafayette.edu/~gexia/research/mfcs06.pdf