Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
A directed graph has a natural Z-module homomorphism from the underlying graph’s cycle space to Z where the image of an oriented cycle is the number of forward edges minus the n...
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...