A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs

Open in new window