SIGN IN
SIGN UP
On the maximum degree of minimum spanning trees
Full Text:
PDF
Buy this Article
Authors:
Gabriel Robins
Department of Computer Science, University of Virginia, Charlottesville, VA
Jeffrey S. Salowe
Department of Computer Science, University of Virginia, Charlottesville, VA
Published in:
· Proceeding
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Pages 250-258
ACM
New York, NY
, USA
©1994
table of contents
ISBN:0-89791-648-4
doi>
10.1145/177424.177978
1994 Article
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 13
· Downloads (cumulative): 416
· Citation Count: 7
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SoCG '13
Share:
|
Tags:
algorithms
computations on discrete structures
geometrical problems and computations
theory
trees
verification
vlsi
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder