4 citations · 4 across the 4 of their papers we have counts for
1 paper · 1 filter
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:…