On certificates and lookahead in dynamic graph problems

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Sanjeev Khanna Department of Computer Science, Stanford University, Stanford, CA
Rajeev Motwani Department of Computer Science, Stanford University, Stanford, CA
Randall H. Wilson Intelligent Systems and Robotics Center, Sandia National Laboratories, Albuquerque, NM
Published in:
· Proceeding
SODA '96 Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Pages 222-231
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©1996
table of contents ISBN:0-89871-366-8
On certificates and lookahead in dynamic graph problems 1996 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 8
· Downloads (cumulative): 198
· Citation Count: 10


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