1664 search results - page 166 / 333 » Distance labeling in graphs |
177
click to vote
CORR
2008
Springer
15 years 6 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...
179
click to vote
PR
2006
15 years 6 months ago
2006
A common approach in structural pattern classification is to define a dissimilarity measure on patterns and apply a distance-based nearest-neighbor classifier. In this paper, we i...
186
click to vote
HYBRID
2010
Springer
15 years 11 months ago
2010
Springer
This paper addresses the problem of self localization of mobile devices. In particular, each device combines noisy measurements of its absolute position with distance measurements...
146
click to vote
ATMOS
2009
15 years 7 months ago
2009
We present a set of three new time-dependent models with increasing flexibility for realistic route planning in flight networks. By these means, we obtain small graph sizes while m...
152
click to vote
ICALP
1995
Springer
15 years 10 months ago
1995
Springer
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be efï...