Irit Katriel, Peter Sanders, Jesper Larsson  Home/Search
Context Related
| mpisb.mpg.de/~san...primfilterTR.ps.gz 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: mpisb.mpg.de/~sanders/pa...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a simple new algorithm for computing minimum spanning trees that is more than two times faster than the best previously known algorithms (for dense, "difficult" inputs). It is of conceptual interest that the algorithm uses the property that the heaviest edge in a cycle can be discarded. Previously this has only been exploited in asymptotically optimal algorithms that are considered to be impractical. An additional advantage is that the algorithm can greatly profit from pipelined... (Update)
Cited by: More
Engineering an External Memory Minimum Spanning Tree.. - Dementiev, Sanders.. (2004) (Correct)
Similar documents (at the sentence level):
67.7%: A Practical Minimum Spanning Tree Algorithm Using the.. - Katriel, Sanders, Träff (2003) (Correct)
Active bibliography (related documents): More All
0.5: Advanced Graph Theory and Combinatorial Optimization - Schrijver (2001) (Correct)
0.4: An Inverse-Ackermann Type Lower Bound for Online Minimum Spanning .. - Pettie (Correct)
0.4: An Inverse-Ackermann Style Lower Bound for MST Verification Queries - Pettie (2002) (Correct)
Similar documents based on text: More All
0.4: Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights - Katriel (2004) (Correct)
0.4: Formalizing OpenMP Performance Properties with ASL - Fahringer, Gerndt, Riley.. (1999) (Correct)
0.3: A Benchmark for MPI Derived Datatypes - Reussner, Träff, Hunzelmann (2000) (Correct)
BibTeX entry: (Update)
I. Katriel, P. Sanders, and J. L. Trff. A practical minimum spanning tree algorithm using the cycle property. In 11th European Symposium on Algorithms (ESA), number 2832 in LNCS, pages 679--690. Springer, 2003. http://citeseer.ist.psu.edu/article/katriel02practical.html More
@misc{ katriel03practical,
author = "I. Katriel and P. Sanders and J. Trff",
title = "A practical minimum spanning tree algorithm using the cycle property",
text = "I. Katriel, P. Sanders, and J. L. Trff. A practical minimum spanning tree
algorithm using the cycle property. In 11th European Symposium on Algorithms
(ESA), number 2832 in LNCS, pages 679--690. Springer, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/article/katriel02practical.html" }
Citations (may not include all citations):375 The LEDA Platform of Combinatorial and Geometric Computing - Mehlhorn, aher - 1999
314 An Introduction to Parallel Algorithms (context) - aj - 1992
183 A data structure for dynamic trees (context) - Sleator, Tarjan - 1983
175 Shortest connection networks and some generalizations (context) - Prim - 1957
137 Prentice Hall (context) - Ahuja, Magnanti et al. - 1993
109 the shortest spanning subtree of a graph and the traveling s.. (context) - Kruskal - 1956
33 A functional approach to external graph algorithms - Abello, Buchsbaum et al. - 2002
31 An optimal minimum spanning tree algorithm - Pettie, Ramachandran - 2000
22 Optimal preprocessing for answering on-line product queries (context) - Alon, Schieber - 1987
10 A simpler minimum spanning tree veri cation algorithm (context) - King - 1997
7 A randomized linear-time algorithm for nding minimum spannin.. (context) - Karger, Klein et al. - 1995
6 Linear veri cation for spanning trees (context) - Koml - 1984
5 Otakar boruvka on minimum spanning tree problem: Translation.. - Milkova - 1926
4 An empirical analysis of algorithms for constructing a minim.. (context) - Moret, Shapiro - 1991
3 A randomized linear-time algorithm for nding minimum spannin.. (context) - Klein, Tarjan - 1994
2 aca Moravske Prrodovedecke Spolecnosti (context) - Jarn, jist et al. - 1930
2 the eciency of pairing heaps and related data structures (context) - Fredman - 1999
2 The maximum capacity route problem (context) - Hu - 1961
2 em problemu minimalnm (context) - Boruvka, jist - 1926
Documents on the same site (http://www.mpi-sb.mpg.de/~sanders/papers/index.html): More
Better Algorithms for Parallel Backtracking - Sanders (1995) (Correct)
Asynchronous Random Polling Dynamic Load Balancing - Sanders (Correct)
A Parallelization of Dijkstra's Shortest Path Algorithm - Crauser, Mehlhorn, Meyer.. (1998) (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