Search
for Author
All Reviews
Dinitz, Michael
Options:
All Media Types
Journals
Proceedings
Div Books
Whole Books
Other
Date Reviewed
Title
Author
Publisher
Published Date
Descending
Ascending
Date Reviewed
1
-
1
of
1
reviews
Efficient distributed computation of distance sketches in networks
Das Sarma A., Dinitz M., Pandurangan G. Distributed Computing 28(5): 309-320, 2015. Type: Article
Shortest path computation is fundamental not only to efficient node-to-node communications, but also to search, discovery of relatedness between uniform resource locators (URLs) or between members of social networks, discovery of netwo...
...
May 11 2016
Reproduction in whole or in part without permission is prohibited. Copyright 1999-2024 ThinkLoud
®
Terms of Use
|
Privacy Policy