Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs
There is a rapidly growing need for scalable algorithms that solve classical graph problems, such as maximum matching and minimum vertex cover, on massive graphs. For massive inputs, several different computational models have been introduced, including the streaming model, the distributed communication model, and the massively parallel computation (MPC) model …