All pairs shortest paths using bridging sets and rectangular matrix multiplication

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Uri Zwick Tel-Aviv University, Tel-Aviv, Israel
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 49 Issue 3, May 2002
Pages 289-317
ACM New York, NY, USA
table of contents doi>10.1145/567112.567114
All pairs shortest paths using bridging sets and rectangular matrix multiplication Published by ACM 2002 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 30
· Downloads (12 Months): 144
· Downloads (cumulative): 1,606
· Citation Count: 61


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