1 paper
Naman Jain
We give a parallel O(log(n))-time algorithm on a CRCW PRAM to assign vertical and horizontal segments to the vertices of any planar bipartite graph G in the following manner:…