Processor efficient parallel matching

Abstract

In this paper we consider the problem of finding perfect matchings in parallel. We present a RNC algorithm with optimal work in respect to sequential algorithms, i.e., it uses O(nω) processors.Our algorithm is based on an RNC algorithm for computing determinant of a degree one polynomial matrix, which is of independent interest.