Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest |
| Συγγραφείς: |
C. K. Poon, Vijaya Ramachandran |
| Συνεισφορές: |
The Pennsylvania State University CiteSeerX Archives |
| Πηγή: |
ftp://ftp.cs.utexas.edu/pub/techreports/tr97-20.ps.Z |
| Έτος έκδοσης: |
1997 |
| Συλλογή: |
CiteSeerX |
| Περιγραφή: |
We present a randomized EREW PRAM algorithm to find a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((log n) 1+ffl ) expected time for any ffl ? 0 and performs linear expected work. This is the first linear work, polylog time algorithm on the EREW PRAM for this problem. This also gives parallel algorithms that perform expected linear work on two more realistic models of parallel computation, the QSM and the BSP. 1 Introduction The design of efficient algorithms to find a minimum spanning forest (MSF) in a weighted undirected graph is a fundamental problem that has received much attention. There have been many algorithms designed for the MSF problem that run in close to linear time (see, e.g., [CLR91]). Recently a randomized linear-time algorithm for this problem was presented in [KKT95]. Based on this work [CKT94] presented a randomized parallel algorithm on the CRCW PRAM which runs in O(2 log n log n) expected time whil. |
| Τύπος εγγράφου: |
text |
| Περιγραφή αρχείου: |
application/postscript |
| Γλώσσα: |
English |
| Relation: |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.6270 |
| Διαθεσιμότητα: |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.6270 |
| Rights: |
Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Αριθμός Καταχώρησης: |
edsbas.9A9A5675 |
| Βάση Δεδομένων: |
BASE |