Journal Article10.1016/0020-0190(75)90056-3
An 0(|E|loglog|V|) algorithm for finding minimum spanning trees☆
176
TL;DR: The algorithm is a modification of an algorithm by SoWn that works by successively enlarging, components al the MST, by shrinking each group of vertices to node, to obtain a new graph with at most odes.
read more
About: This article is published in Information Processing Letters. The article was published on 01 Sep 1975. The article focuses on the topics: Minimum spanning tree & Spanning tree.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Voronoi diagrams—a survey of a fundamental geometric data structure
TL;DR: The Voronoi diagram as discussed by the authors divides the plane according to the nearest-neighbor points in the plane, and then divides the vertices of the plane into vertices, where vertices correspond to vertices in a plane.
4.7K
Fibonacci heaps and their uses in improved network optimization algorithms
TL;DR: Using F-heaps, a new data structure for implementing heaps that extends the binomial queues proposed by Vuillemin and studied further by Brown, the improved bound for minimum spanning trees is the most striking.
Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms
Michael L. Fredman,Robert E. Tarjan +1 more
- 24 Oct 1984
TL;DR: The structure, Fibonacci heaps (abbreviated F-heaps), extends the binomial queues proposed by Vuillemin and studied further by Brown to obtain improved running times for several network optimization algorithms.
1.7K
A Distributed Algorithm for Minimum-Weight Spanning Trees
TL;DR: A distributed algorithm is presented that constructs the minimum weight spanning tree in a connected undirected graph with distinct edge weights that can be initiated spontaneously at any node or at any subset of nodes.
A fast algorithm for Steiner trees
TL;DR: The heuristic algorithm has a worst case time complexity of O(¦S¦¦V¦2) on a random access computer and it guarantees to output a tree that spans S with total distance on its edges no more than 2(1−1/l) times that of the optimal tree.
1.2K
References
•Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
- 01 Jan 1974
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
10.6K
Time bounds for selection
TL;DR: The number of comparisons required to select the i-th smallest of n numbers is shown to be at most a linear function of n by analysis of a new selection algorithm-PICK.
1.5K
Finding the Median
TL;DR: An algorithm is described which determines the median of n elements using in the worst case a number of comparisons asymptotic to 3n.