Finding long paths and cycles in sparse Hamiltonian graphs

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Tomas Feder
Rajeev Motwani Department of Computer Science, Stanford University, CA
Carlos Subi
Published in:
Cover Image
 
· Proceeding
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Pages 524-529
ACM New York, NY, USA ©2000
table of contents ISBN:1-58113-184-4 doi>10.1145/335305.335368
Finding long paths and cycles in sparse Hamiltonian graphs Published by ACM 2000 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 17
· Downloads (cumulative): 604
· Citation Count: 7


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