Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs
Authors:
Conference:
This paper resolves several open questions raised by Czumaj et.al. in
[CLMMOS'18] regarding finding matchings and vertex covers in the massively parallel computation (MPC) model.
Abstract:
Conference version:
Full version:
Presentation slides:
BibTex: