266 search results - page 18 / 54 » Graphs with Bounded Induced Distance |
CORR
2008
Springer
13 years 9 months ago
2008
Springer
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...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
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...
GC
2010
Springer
13 years 7 months ago
2010
Springer
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...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
—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...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
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...