An optimal parallel matching algorithm for cographs

The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. The authors show that the problem of finding a maximum matching in a cograph can be solved optimally in parallel by reducing it to parenthesis matching. With a n-vertex cograph G represented by its parse tree as input the algorithm finds a maximum matching in G in O(log n) time using O(n/log n) processors in the EREW-PRAM model.<
>