1 paper
Marcel Birn, Vitaly Osipov, Peter Sanders +2
We show that a simple algorithm for computing a matching on a graph runs in a logarithmic number of phases incurring work linear in the input size. The algorithm can be adapted to…