SIGN IN
SIGN UP
Orderly spanning trees with applications to graph encoding and graph drawing
Full Text:
Pdf
Buy this Article
Authors:
Yi-Ting Chiang
Institute of Information Science, Academia Sinica, Taipei 115, Taiwan
Ching-Chi Lin
Institute of Information Science, Academia Sinica, Taipei 115, Taiwan
Hsueh-I Lu
Institute of Information Science, Academia Sinica, Taipei 115, Taiwan
Published in:
· Proceeding
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©2001
table of contents
ISBN:0-89871-490-7
2001 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 14
· Citation Count: 23
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
computations on discrete structures
design
general
theory
verification
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