Yijie Han  Home/Search
Context Related
| umkc.edu/~hanyij/research/bit.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umkc.edu/~hanyij/research...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present an EREW parallel algorithm for the PROFIT/COST problem with time complexity O(log n) using a linear number of processors. The design of this algorithm employs both the derandomization technique and the pipeline technique. The algorithm 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... (Update)
Similar documents based on text: More All
0.5: Parallel PROFIT/COST Algorithms through Fast Derandomization - Han (Correct)
0.4: A Fast Derandomization Scheme and Its Applications - Yijie Han Department (1996) (Correct)
0.3: Derandomization by Exploiting Redundancy - And Mutual Independence (Correct)
BibTeX entry: (Update)
Y. Han. A parallel algorithm for the PROFIT/COST problem. Proc. 1991. http://citeseer.ist.psu.edu/704508.html More
@inproceedings{ han91parallel,
author = "Yijie Han",
title = "A Parallel Algorithm for the {PROFIT}/{COST} Problem",
booktitle = "Proceedings of the 1991 International Conference on Parallel Processing",
volume = "III, Algorithms \& Applications",
publisher = "CRC Press",
address = "Boca Raton, FL",
pages = "III--107--III--114",
year = "1991",
url = "citeseer.ist.psu.edu/704508.html" }
Citations (may not include all citations):218 Parallelism in random access machines (context) - Fortune, Wyllie - 1978
199 A simple parallel algorithm for the maximal independent set .. (context) - Luby - 1986
122 Parallel tree contraction and its application (context) - Miller, Reif - 1985
41 Removing randomness in parallel computation without a proces.. - Luby
41 Removing randomness in parallel computation without a proces.. - Luby - 1988
26 An improved parallel algorithm for maximal matching (context) - Israeli, Shiloach - 1986
16 Constructing a maximal independent set in parallel - Goldberg, Spencer - 1989
4 Derandomization by exploiting redundancy and mutual independ.. (context) - Han, Igarashi - 1990
1 Computer Sci (context) - Han, derandomization et al.
Documents on the same site (http://www.sice.umkc.edu/~hanyij/research/index.htm): More
Matching Partition a Linked List and Its Optimization - Han (1989) (Correct)
Time Lower Bounds for Sorting on Multi-Dimensional.. - Han, Igarashi (1990) (Correct)
An Optimal Linked List Prefix Algorithm on a Local Memory Computer - Han (1991) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC