Perfect matchings in random graphs with prescribed minimal degree

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Alan Frieze Carnegie Mellon University, Pittsburgh PA
Boris Pittel Ohio State University, Columbus, OH
Published in:
· Proceeding
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Pages 148-157
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2003
table of contents ISBN:0-89871-538-5
Perfect matchings in random graphs with prescribed minimal degree 2003 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 17
· Downloads (cumulative): 455
· Citation Count: 1


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