Topic
Expected linear time MST algorithm
About: Expected linear time MST algorithm is a research topic. Over the lifetime, 108 publications have been published within this topic receiving 7163 citations.
Papers published on a yearly basis
Papers
Book•
1 Jan 1983TL;DR: This paper presents a meta-trees tree model that automates the very labor-intensive and therefore time-heavy and therefore expensive process of manually selecting trees to grow in a graph.
Abstract: Foundations Disjoint Sets Heaps Search Trees Linking and Cutting Trees Minimum Spanning Trees Shortest Paths Network Flows Matchings
2,394 citations
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.
Abstract: Abstract : A distributed algorithm is presented that constructs the minimum weight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm and exchange messages with neighbors until the tree is constructed. The total number of messages required for a graph of N nodes and E edges is at most 5N log of N to the base 2 + 2E and a message contains at most one edge weight plus log of 8N to the base 2 bits. The algorithm can be initiated spontaneously at any node or at any subset of nodes.
1,276 citations
TL;DR: A randomized linear-time algorithm to find a minimum spanning tree in a connected graph with edge weights is presented, a unit-cost random-access machine with the restriction that the only operations allowed on edge weights are binary comparisons.
Abstract: We present a randomized linear-time algorithm to find a minimum spanning tree in a connected graph with edge weights. The algorithm uses random sampling in combination with a recently discovered linear-time algorithm for verifying a minimum spanning tree. Our computational model is a unit-cost random-access machine with the restriction that the only operations allowed on edge weights are binary comparisons.
493 citations
TL;DR: The first English translation of both of Borůvka's pioneering works, which are generally regarded as a cornerstone of Combinatorial Optimization, are presented.
406 citations
22 May 2005
TL;DR: This work presents a polynomial time 2-approximation algorithm for the problem of finding the minimum tree that spans at least k vertices and develops two algorithms for finding the maximum number of vertices that can be spanned by a tree of length at most a given bound.
Abstract: We present a polynomial time 2-approximation algorithm for the problem of finding the minimum tree that spans at least k vertices. Our result also leads to a 2-approximation algorithm for finding the minimum tour that visits k vertices and to a 3-approximation algorithm for the problem of finding the maximum number of vertices that can be spanned by a tree of length at most a given bound.
251 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2017 | 1 |
| 2016 | 2 |
| 2015 | 1 |
| 2014 | 1 |
| 2013 | 8 |
| 2012 | 6 |