In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the verticesâ€¦Â (More)

(More)

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

Highly Cited

2006

Highly Cited

2006

- Oleksandr Grygorash, Yan Zhou, Zach Jorgensen
- 2006 18th IEEE International Conference on Toolsâ€¦
- 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

- Ryan T. McDonald, Fernando Pereira, Kiril Ribarov, Jan Hajic
- HLT/EMNLP
- 2005

We formalize weighted dependency parsing as searching for maximum spanning trees (MSTs) in directed graphs. Using thisâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Michael J. Laszlo, Sumitra Mukherjee
- 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

2004

Highly Cited

2004

- Srikant Sharma, Kartik Gopalan, Susanta Nanda, Tzi-cker Chiueh
- IEEE INFOCOM 2004
- 2004

Simplicity, cost effectiveness, scalability, and the economies of scale make Ethernet a popular choice for local area networksâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- GÃ¼nther R. Raidl, Bryant A. Julstrom
- IEEE Trans. Evolutionary Computation
- 2003

The fundamental design choices in an evolutionary algorithm are its representation of candidate solutions and the operators thatâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Seth Pettie, Vijaya Ramachandran
- ICALP
- 2000

We establish that the algorithmic complexity of the minimumspanning tree problem is equal to its decision-tree complexityâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Bernard Chazelle
- 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?

Highly Cited

1985

Highly Cited

1985

- Ronald L. Graham, Pavol Hell
- 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

1983

Highly Cited

1983

- Mohan Ahuja, Yahui Zhu
- ICDCS
- 1983

A distributed algorithm is presented that constructs the minimum-weight spanning tree in a connected undirected graph withâ€¦Â (More)

Is this relevant?

Highly Cited

1974

Highly Cited

1974

- T. C. Hu
- SIAM J. Comput.
- 1974

Given a set of nodes N (i 1, 2, ..., n) which may represent cities and a set of requirements ria which may represent the numberâ€¦Â (More)

Is this relevant?