MohammadHossein Bateni

Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs

2017 · arXiv (Cornell University)

As massive graphs become more prevalent, there is a rapidly growing need for scalable algorithms that solve classical graph problems, such as maximum matching and minimum vertex cover, on large datasets. For massive inputs, several …