We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.
ional Frameworks: Toolkits and Abstractions In Introductory Computer Science Cynthia Brown, Harriet Fell, Viera Proulx, Richard Rasala College of Computer Science, Northeastern Uni...
Cynthia A. Brown, Harriet J. Fell, Viera K. Proulx...
- On April 23, 1993 a panel discussion was held at the IEEE International Conferenceon Data Engineering in Vienna, Austria, at which five membersof the data base researchcommunity ...
Michael Stonebraker, Rakesh Agrawal, Umeshwar Daya...