1664 search results - page 140 / 333 » Distance labeling in graphs |
126
click to vote
SODA
2007
ACM
15 years 6 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
229
click to vote
CPC
2007
15 years 4 months ago
2007
In 1972, M. Rosenfeld asked if every triangle-free graph could be embedded in the unit sphere Sd in such a way that two vertices joined by an edge have distance more than √ 3 (i...
157
click to vote
MOBIHOC
2001
ACM
16 years 4 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
155
Voted
CVPR
2010
IEEE
16 years 29 days ago
2010
IEEE
Large scale image search has recently attracted considerable attention due to easy availability of huge amounts of data. Several hashing methods have been proposed to allow approx...
237
click to vote
GIS
2007
ACM
16 years 5 months ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...