334 search results - page 52 / 67 » Practical Parallel Algorithms for Minimum Spanning Trees |
ICPP
2008
IEEE
15 years 4 months ago
2008
IEEE
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
SPAA
1997
ACM
15 years 1 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
PSB
2003
14 years 11 months ago
2003
This paper is concerned with evaluating the performance of the model and algorithm in [7] for detecting lateral gene transfers events. Using a Poisson process to describe arrival t...
SPAA
2004
ACM
15 years 3 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
103
click to vote
IJCNN
2000
IEEE
15 years 2 months ago
2000
IEEE
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...