Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Noga Alon Institute for Advanced study, School of Mathematics, Princeton, NJ and School of Mathematical Science, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978, I ...
Raphy Yuster School of Mathematical Science, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978, Israel
Uri Zwick School of Mathematical Science, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978, Israel
Published in:
· Proceeding
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Pages 326 - 335
ACM New York, NY, USA ©1994
table of contents ISBN:0-89791-663-8 doi>10.1145/195058.195179
Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs Published by ACM 1994 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 9
· Downloads (12 Months): 40
· Downloads (cumulative): 702
· Citation Count: 16


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