Paper

On the maximum degree of minimum spanning trees

1994

Created by Alysson Bolognesi Prado at 2019-03-28 08:56:45.0.

Simplified Graph of Associations

Word Cloud

Bibliographic Sets

1

Research Paradigm

Authors

2

Jeffrey S. Salowe

Venue

1

Proceedings of the tenth annual symposium on Computational geometry - SCG ’94

References

5

Enhanced Serial and Parallel Implementations of the Iterated 1-Steiner Algorithm, in Proc

Near-Optimal Steiner Trees in Polynomial Time, in Proc

ficient Algorithms for Agglomerative Hierarchical Clustemng Methods, J

A Guide to the Theory of NP-Completeness, W

The 1-steiner tree problem