Academic Journal
A randomized linear work EREW PRAM algorithm to find a minimum spanning forest
| Τίτλος: | A randomized linear work EREW PRAM algorithm to find a minimum spanning forest |
|---|---|
| Συγγραφείς: | Chung Keung Poon, Vijaya Ramachandran |
| Συνεισφορές: | The Pennsylvania State University CiteSeerX Archives |
| Πηγή: | http://www.cs.utexas.edu/~vlr/papers/mst97.pdf. |
| Στοιχεία εκδότη: | Springer-Verlag |
| Έτος έκδοσης: | 1997 |
| Συλλογή: | CiteSeerX |
| Περιγραφή: | We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an nvertex graph the algorithm runs in o((log n) 1+) expected time for any >0 and performs linear expected work. This is the rst linear work, polylog time algorithm on the EREW PRAM for this problem. This also gives parallel algorithms that perform expected linear work on two general-purpose models of parallel computation -- the QSM and the BSP. |
| Τύπος εγγράφου: | text |
| Περιγραφή αρχείου: | application/pdf |
| Γλώσσα: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.514; http://www.cs.utexas.edu/~vlr/papers/mst97.pdf |
| Διαθεσιμότητα: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.514 http://www.cs.utexas.edu/~vlr/papers/mst97.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Αριθμός Καταχώρησης: | edsbas.BDF0AF15 |
| Βάση Δεδομένων: | BASE |
καταχωρήστε σχόλιο πρώτοι!