Balasubramanian; Fellows (The Vertex Cover Problem The Vertex Cover Problem)

From Algorithm Wiki
Revision as of 10:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(kn + ({1.324718})$^k * k^{2}) == Space Complexity == $O(k^{3})$ auxiliary? (potentially $O(k^{2})$??) words ((see remark in algo id #576)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1996 == Reference == https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.711.8844")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(kn + ({1.324718})$^k * k^{2})

Space Complexity

$O(k^{3})$ auxiliary? (potentially $O(k^{2})$??) words

((see remark in algo id #576))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1996

Reference

https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.711.8844

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Balasubramanian;_Fellows_(The_Vertex_Cover_Problem_The_Vertex_Cover_Problem)&oldid=44877"