The forgiving graph: a distributed data structure for low stretch under adversarial attack

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Thomas P. Hayes University of New Mexico, Albuquerque, NM, USA
Jared Saia University of New Mexico, Albuquerque, NM, USA
Amitabh Trehan University of New Mexico, Albuquerque, NM, USA
Published in:
Cover Image
 
· Proceeding
PODC '09 Proceedings of the 28th ACM symposium on Principles of distributed computing
Pages 121-130
ACM New York, NY, USA ©2009
table of contents ISBN: 978-1-60558-396-9 doi>10.1145/1582716.1582740
The forgiving graph: a distributed data structure for low stretch under adversarial attack Published by ACM 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 30
· Downloads (cumulative): 189
· Citation Count: 4


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