activity
20182022
most citedFaster Algorithms for Bounded Tree Edit Distance

2 citations · 5 across the 6 of their papers we have counts for

collaborators
Showing cs.DCShow all

1 paper · 1 filter

cs.DC2020

Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond

Mohsen Ghaffari, Christoph Grunau, Ce Jin

We present round scalable Massively Parallel Computation algorithms for maximal independent set and maximal matching, in trees and more generally graphs of bounded…