14 citations · 74 across the 36 of their papers we have counts for
1 paper · 1 filter
Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein +2
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 co…