Balasubramanian; Fellows (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.

    15 February 2023

    • curprev 11:5311:53, 15 February 2023‎ Admin talk contribs‎ 401 bytes +401‎ 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Balasubramanian;_Fellows_(The_Vertex_Cover_Problem_The_Vertex_Cover_Problem)"