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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1992-2018
0119922018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Computation of the trace of a matrix function plays an important role in many scientific computing applications, including… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2016
2016
Computation of the trace of a matrix function plays an important role in many scientific computing applications, including… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2015
2015
Logarithms of determinants of large positive definite matrices appear ubiquitously in machine learning applications including… (More)
Is this relevant?
2014
2014
We consider the problem of embedding an undirected graph into hyperbolic space with minimum distortion. A fundamental problem in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Let G = (V, E) be an undirected weighted graph on |V | = n vertices, and |E| = m edges. A t-spanner of the graph G, for any t ≥ 1… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
We present provably efficient parallel algorithms for sweep scheduling on unstructured meshes. Sweep scheduling is a commonly… (More)
  • figure 1
  • figure 3
  • figure 2
Is this relevant?
2003
2003
  • Surender Baswanay, Sandeep Senz
  • 2003
Let G(V;E) be an undirected weighted graph with jV j = n, and jEj = m. A t-spanner of the graph G(V;E) is a sub-graph G(V;ES), ES… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1993
1993
For a polygon <italic>P</italic>, the bounded Voronoi diagram of <italic>P</italic> is a partition of <italic>P</italic> into… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Koml os has devised a way to use a linear number of binary comparisons to test whether a given spanning tree of a graph with edge… (More)
Is this relevant?