Skip to search formSkip to main contentSkip to account menu

Expected linear time MST algorithm

A randomized algorithm for computing the minimum spanning forest of a weighted graph with no isolated vertices. It was developed by David Karger… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Binary treeBorůvka's algorithmGraph (discrete mathematics)Kruskal's algorithm

Broader (1)

Spanning tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
N ov 2 01 5 Decoding Reed-Muller codes over product sets
We give a polynomial time algorithm to decode multivariate polynomial codes of degree d up to half their minimum distance, when… 
Review
2017
Review
2017
Efficient Integer DCT Architecture for mpeg-4 part 10 / HEVC
In this project we have proposed a low-cost high throughput multistandard transform (MST) core, which can support MPEG 1/2/4 (8… 
2015
2015
Nonparametric belief propagation based cooperative localization: A minimum spanning tree approach
Nonparametric belief propagation (NBP) algorithm can result in approximately optimal performance for probabilistic localization… 
2014
2014
Multi-source transfer ELM-based Q learning
2011
2011
Observations on the distribution of monophasic Salmonella Typhimurium on pig farms in Great Britain
Ten pig herds were visited and intensively sampled to determine the within group prevalence, distribution of contamination and… 
2009
2009
Particle swarm optimization for the degree-constrained MST problem in WSN topology control
The multi-criteria degree-constrained minimum spanning tree problem (mcd-MST) is an important issue in wireless sensor networks… 
2006
2006
Provable algorithms for parallel generalized sweep scheduling
2005
2005
Provable algorithms for parallel sweep scheduling on unstructured meshes
We present provably efficient parallel algorithms for sweep scheduling on unstructured meshes. Sweep scheduling is a commonly… 
2003
2003
A Simple Linear Time Algorithm for Computing Sparse Spanners in Weighted Graphs
Let be an undirected weighted graph with , and . A -spanner of the graph is a sub-graph , , such that the distance between any… 
2000
2000
Fluctuation Measurements on the Madison Symmetric Torus with a Heavy Ion Beam Probe
Measurements of electron density fluctuations e n~ and potential fluctuations Φ ~ on the Madison Symmetric Torus (MST) reversed… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)