Abstract.
We present parallel algorithms for the PROFIT/COST problem with time complexity \(O(\log n)\) 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 18 March 1992 / 8 January 1999
Rights and permissions
About this article
Cite this article
Han, Y., Igarashi, Y. Parallel PROFIT/COST algorithms through fast derandomization. Acta Informatica 36, 215–232 (1999). https://doi.org/10.1007/s002360050158
Issue Date:
DOI: https://doi.org/10.1007/s002360050158