Efficient algorithms for Petersen's matching theorem

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Therese C. Biedl School of Computer Science, McGill University, 3480 University Street, Montreal, Quebec H3A 2A7, Canada
Prosenjit Bose School of Computer Science, Carleton University, 1125 Colonel by Drive, Ottawa, Ontario K1S 5B6, Canada
Erik D. Demaine Department of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
Anna Lubiw Department of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
Efficient algorithms for Petersen's matching theorem 1999 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 17
· Downloads (cumulative): 449
· Citation Count: 8

Published in:
· Proceeding
SODA '99 Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Pages 130-139
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©1999
table of contents ISBN:0-89871-434-6

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