NETWORKS
2010
13 years 11 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
CORR
2008
Springer
14 years 17 days ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...