SIGN IN
SIGN UP
The full degree spanning tree problem
Full Text:
Pdf
Buy this Article
Authors:
Randeep Bhatia
Bell Labs, Lucent Technologies, Murray Hill, NJ
Samir Khuller
Computer Science Dept., University of Maryland, College Park, MD
Robert Pless
Computer Science Dept., University of Maryland, College Park, MD
Yoram J. Sussmann
Computer Science Dept., University of Maryland, College Park, MD
1999 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 8
· Citation Count: 2
Published in:
· Proceeding
SODA '99
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©1999
table of contents
ISBN:0-89871-434-6
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
experimentation
graph algorithms
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