1 paper · 1 filter
Sujoy Bhore, Sarfaraz Equbal, Rohit Gurjar
In this work, we study the parallel complexity of the Euclidean minimum-weight perfect matching (EWPM) problem. Here our graph is the complete bipartite graph G on two sets of po…