Ka Wong Chong, Yijie Han, Tak Wah Lam  Home/Search
Context Related
| umkc.edu/~hanyij/research/sodamst.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 a new approach to finding minimum spanning trees of weighted undirected graphs on the parallel random access machine (PRAM) without concurrent-write power. This approach gives an algorithm that runs in O(log n) time using n+m processors on the EREW PRAM, settling a long-standing open problem in the literature. (Update)
Context of citations to this paper: More
...re using random bits. 1.1. 1 Parallel MST Connectivity The best deterministic parallel MST and connectivity algorithms [CV86, CV91, CHL99] run in logarithmic time yet they all use superlinear work. There are somewhat simpler logarithmic time linear expected work randomized...
...the MSF problem. A related question is the parallel work time complexity of this problem. In this context, resolved recently were the randomized work time complexity [PR99] and the deterministic time complexity [CHL99] of the MSF problem on the EREW PRAM. An open question that...
Cited by: More
Improving the Efficiency of Parallel Minimum Spanning Tree.. - Chong, Han, al. (2001) (Correct)
An Optimal Minimum Spanning Tree Algorithm - Pettie, Ramachandran (1999) (Correct)
Minimizing Randomness in Minimum Spanning Tree, Parallel.. - Pettie, Ramachandran (Correct)
Similar documents (at the sentence level):
5.5%: Concurrent Threads and Optimal Parallel Minimum Spanning.. - Chong, Han, Lam (2001) (Correct)
Active bibliography (related documents): More All
0.7: On the Parallel Time Complexity of Undirected Connectivity.. - Chong, Han, Lam (1999) (Correct)
0.4: Optimal randomized EREW PRAM algorithms for finding spanning.. - Halperin, Zwick (2000) (Correct)
0.4: Practical Parallel Algorithms for Minimum Spanning Trees - Dehne, Götz (1998) (Correct)
Similar documents based on text: More All
0.4: Concurrent Threads and Optimal Parallel Minimum - Spanning Trees Algorithm (Correct)
0.2: Improved Deterministic Parallel Padded Sorting - Chong, Ramos (Correct)
0.2: Efficient Parallel Algorithms for Computing All Pair Shortest .. - Han, Pan, Reif (1997) (Correct)
Related documents from co-citation: More All
6: A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning.. - Pettie, Ramachandran - 1999
6: jist'em probl'emu minima'aln ' im (context) - Boruvka - 1926
5: Fibonacci heaps and their uses in improved network optimization algorithms (context) - Fredman, Tarjan - 1987
BibTeX entry: (Update)
K. W. Chong, Y. Han, T. W. Lam. On the parallel time complexity of undirected connectivity and minimum spanning trees. In Proc. SODA 1999, pp. 225-234. http://citeseer.ist.psu.edu/chong99parallel.html More
@inproceedings{ chong99parallel,
author = "Chong and Han and Lam",
title = "On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees",
booktitle = "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)",
year = "1999",
url = "citeseer.ist.psu.edu/chong99parallel.html" }
Citations (may not include all citations):268 Parallel Algorithms for Shared-Memory Machines (context) - Karp, Ramachandran - 1990
258 Data Structures and Network Algorithms (context) - Tarjan - 1983
135 An Introduction to Parallel Algorithms (context) - J'aJ'a - 1992
94 Upper and lower time bounds for parallel random access machi.. (context) - Cook, Dwork et al. - 1986
77 An Efficient Parallel Biconnectivity Algorithm (context) - Tarjan, Vishkin - 1985
49 Approximate and Exact Parallel Scheduling with Applications .. (context) - Cole, Vishkin
47 A randomized linear-time algorithm to find minimum spanning .. - Karger, Klein et al. - 1995
45 Efficient algorithms for finding minimum spanning trees in u.. (context) - Gabow, Galil et al. - 1986
28 New Connectivity and MSF Algorithms for Shuffle-exchange Net.. (context) - Awerbuch, Shiloach - 1987
28 A Parallel Algorithm for Computing Minimum Spanning Trees - Johnson, Metaxas
21 Random sampling in Graph Optimization Problems (context) - Karger - 1995
20 Finding Connected Components in O (context) - Chong, Lam
20 Fast Connected Components Algorithms for the EREW PRAM - Karger, Nisan et al.
20 Parallel Time for the CREW PRAM (context) - Johnson, Metaxas et al.
13 A Faster Deterministic Algorithm for Minimum Spanning Trees (context) - Chazelle
11 A Randomized Linear Work EREW PRAM Algorithm to Find a Minim.. - Poon, Ramachandran - 1997
11 Finding minimum spanning forests in logarithmic time and lin.. - Cole, Klein et al.
8 Finding Minimum Spanning Trees on the EREW PRAM (context) - Chong - 1996
The graph only includes citing articles where the year of publication is known.
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