On the Maximum Degree of Minimum Spanning Trees (Extended Abstract)

On the Maximum Degree of Minimum Spanning Trees (Extended Abstract) (1994)

Cached

Download Links

[ftp.cs.virginia.edu]

Other Repositories/Bibliography

DBLP

by Gabriel Robins , Jeffrey S. Salowe

Venue:

IN PROC. ACM SYMP. COMPUTATIONAL GEOMETRY, STONY

Versions

Version History

Metadata Version 6

User correction supplied by mph

Datum	Value	Source
TITLE	On the Maximum Degree of Minimum Spanning Trees (Extended Abstract)	user correction
AUTHOR NAME	Gabriel Robins	user correction
AUTHOR AFFIL	Department of Computer Science, Thornton Hall, University of Virginia	user correction
AUTHOR ADDR	Charlottesville, VA 22903-2442	user correction
AUTHOR NAME	Jeffrey S. Salowe	user correction
AUTHOR AFFIL	Department of Computer Science, Thornton Hall, University of Virginia	user correction
AUTHOR ADDR	Charlottesville, VA 22903-2442	user correction
ABSTRACT	Motivated by practical VLSI applications, we study the maximum vertex degree in a minimum spanning tree (MST) under arbitrary L p metrics. We show that the maximum vertex degree in a maximum-degree L p MST equals the Hadwiger number of the corresponding unit ball. We then determine the maximum vertex degree in a minimum-degree L p MST; towards this end, we define the MST number, which is closely related to the Hadwiger number. We bound Hadwiger and MST numbers for arbitrary L p metrics, and focus on the L 1 metric, where little was known. We show that the MST number of a diamond is 4, and that for the octahedron the Hadwiger number is 18 and the MST number is either 13 or 14. We also give an exponential lower bound on the MST number for an L p unit ball. Implications to L p minimum spanning trees and related problems are explored.	user correction - Legacy Corrections
YEAR	1994	INFERENCE
VENUE	IN PROC. ACM SYMP. COMPUTATIONAL GEOMETRY, STONY	user correction
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	250--258	INFERENCE
CITATIONS	17 found	ParsCit 1.0