An optimal algorithm for the maximum two-chain problem

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: R. D. Lou Center for Integrated Microelectronic Systems (CIMS), The Technological Institute, Northwestern University, Evanston, IL and Department of Electrical Engineering and Computer Science
M. Sarrafzadeh Center for Integrated Microelectronic Systems (CIMS), The Technological Institute, Northwestern University, Evanston, IL and Department of Electrical Engineering and Computer Science
D. T. Lee Center for Integrated Microelectronic Systems (CIMS), The Technological Institute, Northwestern University, Evanston, IL and Department of Electrical Engineering and Computer Science
Published in:
· Proceeding
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Pages 149-158
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©1990
table of contents ISBN:0-89871-251-3
An optimal algorithm for the maximum two-chain problem 1990 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 13
· Downloads (cumulative): 184
· Citation Count: 2


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder