Amir Azarmehr

Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS

Maximum matching is one of the most fundamental combinatorial optimization problems with applications in various contexts such as balanced clustering, data mining, resource allocation, and online advertisement. In many of these applications, the input graph is massive. The sheer size of these inputs…