Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2003

Highly Cited

2003

The bottleneck of the state-of-the-art algorithms for geometric Steiner problems is usually the concatenation phase, where the… Expand

Highly Cited

2002

Highly Cited

2002

We establish that the algorithmic complexity of the minimumspanning tree problem is equal to its decision-tree complexity… Expand

Highly Cited

1995

Highly Cited

1995

We present a randomized linear-time algorithm to find a minimum spanning tree in a connected graph with edge weights. The… Expand

Highly Cited

1986

Highly Cited

1986

Recently, Fredman and Tarjan invented a new, especially efficient form of heap (priority queue). Their data structure… Expand

Highly Cited

1985

Highly Cited

1985

It is standard practice among authors discussing the minimum spanning tree problem to refer to the work of Kruskal(1956) and Prim… Expand

Highly Cited

1983

Highly Cited

1983

Abstract : A distributed algorithm is presented that constructs the minimum weight spanning tree in a connected undirected graph… Expand

Highly Cited

1982

Highly Cited

1982

The problem of finding a minimum spanning tree connecting n points in a k-dimensional space is discussed under three common… Expand

Highly Cited

1976

Highly Cited

1976

This paper studies methods for finding minimum spanning trees in graphs. Results include 1. several algorithms with $O(m\log \log… Expand

Highly Cited

1971

Highly Cited

1971

The relationship between the symmetric traveling-salesman problem and the minimum spanning tree problem yields a sharp lower… Expand

Highly Cited

1969

Highly Cited

1969

Minimum spanning trees (MST) and single linkage cluster analysis (SLCA) are explained and it is shown that all the information… Expand