# Minimum spanning tree

## Papers overview

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

Highly Cited

2006

Highly Cited

2006

- 18th IEEE International Conference on Tools withâ€¦
- 2006

The minimum spanning tree clustering algorithm is known to be capable of detecting clusters with irregular boundaries. In thisâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- IEEE Transactions on Knowledge and Dataâ€¦
- 2005

This paper presents a clustering algorithm for partitioning a minimum spanning tree with a constraint on minimum group size. Theâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- ICALP
- 2000

Weestablishthatthealgorithmiccomplexity of theminimumspanningtreeproblemisequal to its decision-treecomplexity. Specificallyâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- J. ACM
- 2000

A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is <italic>0â€¦Â (More)

Is this relevant?

1999

1999

- 1999

MST is fundamental problem with diverse applications. â– Designing physical networks. â€“ telephone, electrical, hydraulic, TV cableâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Algorithmica
- 1997

The problem considered here is that of determining whether a given spanning tree is a minimal spanning tree. In 1984 KomlÃ³sâ€¦Â (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- Annals of the History of Computing
- 1985

It is standard practice among authors discussing the minimum spanning tree problem to refer to the work of Kruskal(1956) and Primâ€¦Â (More)

Is this relevant?

Highly Cited

1980

Highly Cited

1980

- Computers & OR
- 1980

In this paper the problem of a degree-constrained minimum spanning tree (DCMST) is defined. The problem is formulated as a linearâ€¦Â (More)

Is this relevant?

Highly Cited

1976

Highly Cited

1976

- SIAM J. Comput.
- 1976

This paper gives a method for finding a minimum spanning tree in an undirected graph. If the problem graph has n vertices and eâ€¦Â (More)

Is this relevant?

Highly Cited

1969

Highly Cited

1969

- 1969

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range ofâ€¦Â (More)

Is this relevant?