|
|||||
|
|
Parallel PROFIT/COST algorithms through fast derandomization |
|
| Authors: | Yijie Han Yoshihide Igarashi |
| Affiliation: | (1) Electronic Data Systems Inc., 750 Tower Drive CPS, Mail Stop 7121, Troy, MI 48098, USA (e-mail: yhan01@cps.plnin.gmeds.com) , US;(2) Department of Computer Science, Gunma University, Kiryu, 376 Japan (e-mail: igarashi@comp.cs.gunma-u.ac.jp) , JP |
| Abstract: | We present parallel algorithms for the PROFIT/COST problem with time complexity using O(m+n) processors. The design of these algorithms employ both the derandomization technique and the pipeline technique. They can be used to partition the vertices of a graph into two sets such that the number of edges incident with vertices in both sets is at least half of the total number of edges in the graph. Parallel algorithms for the PROFIT/COST problem have known applications in the design of parallel algorithms for several graph problems. Received: 18 March 1992 / 8 January 1999 |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |