Results 1  10
of
19
Approximate distance oracles
 J. ACM
"... Let G = (V, E) be an undirected weighted graph with V  = n and E  = m. Let k ≥ 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn 1/k) expected time, constructing a data structure of size O(kn 1+1/k), such that any subsequent distance query can be answered, approximately, in ..."
Abstract

Cited by 210 (8 self)
 Add to MetaCart
Let G = (V, E) be an undirected weighted graph with V  = n and E  = m. Let k ≥ 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn 1/k) expected time, constructing a data structure of size O(kn 1+1/k), such that any subsequent distance query can be answered, approximately, in O(k) time. The approximate distance returned is of stretch at most 2k − 1, i.e., the quotient obtained by dividing the estimated distance by the actual distance lies between 1 and 2k−1. A 1963 girth conjecture of Erdős, implies that Ω(n 1+1/k) space is needed in the worst case for any real stretch strictly smaller than 2k + 1. The space requirement of our algorithm is, therefore, essentially optimal. The most impressive feature of our data structure is its constant query time, hence the name “oracle”. Previously, data structures that used only O(n 1+1/k) space had a query time of Ω(n 1/k). Our algorithms are extremely simple and easy to implement efficiently. They also provide faster constructions of sparse spanners of weighted graphs, and improved tree covers and distance labelings of weighted or unweighted graphs. 1
Gem: graph embedding for routing and datacentric storage in sensor networks without geographic information
, 2003
"... Information ..."
Reachability and Distance Queries via 2Hop Labels
, 2002
"... Reachability and distance queries in graphs are fundamental to numerous applications, ranging from geographic navigation systems to Internet routing. Some of these applications involve huge graphs and yet require fast query answering. We propose a new data structure for representing all distances in ..."
Abstract

Cited by 77 (0 self)
 Add to MetaCart
Reachability and distance queries in graphs are fundamental to numerous applications, ranging from geographic navigation systems to Internet routing. Some of these applications involve huge graphs and yet require fast query answering. We propose a new data structure for representing all distances in a graph. The data structure is distributed in the sense that it may be viewed as assigning labels to the vertices, such that a query involving vertices u and v may be answered using only the labels of u and v.
Proximity search in databases
 In VLDB
, 1998
"... An information retrieval (IR) engine can rank documents based on textual proximityofkeywords within each document. In this paper we apply this notion to search across an entire database for objects that are \near " other relevant objects. Proximity search enables simple \focusing " queries ..."
Abstract

Cited by 60 (1 self)
 Add to MetaCart
An information retrieval (IR) engine can rank documents based on textual proximityofkeywords within each document. In this paper we apply this notion to search across an entire database for objects that are \near " other relevant objects. Proximity search enables simple \focusing " queries based on general relationships among objects, helpful for interactive query sessions. We view the database as a graph, with data in vertices (objects) and relationships indicated by edges. Proximity is dened based on shortest paths between objects. We have implemented a prototype search engine that uses this model to enable keyword searches over databases, and we have found it very e ective for quickly nding relevant information. Computing the distance between objects in a graph stored on disk can be very expensive. Hence, we show how to build compact indexes that allow us to quickly nd the distance between objects at search time. Experiments show that our algorithms are ecient and scale well. 1
Treedecompositions with bags of small diameter
, 2007
"... This paper deals with the length of a Robertson–Seymour’s treedecomposition. The treelength of a graph is the largest distance between two vertices of a bag of a treedecomposition, minimized over all treedecompositions of the graph. The study of this invariant may be interesting in its own right ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
This paper deals with the length of a Robertson–Seymour’s treedecomposition. The treelength of a graph is the largest distance between two vertices of a bag of a treedecomposition, minimized over all treedecompositions of the graph. The study of this invariant may be interesting in its own right because the class of bounded treelength graphs includes (but is not reduced to) bounded chordality graphs (like interval graphs, permutation graphs, ATfree graphs, etc.). For instance, we show that the treelength of any outerplanar graph is ⌈k/3⌉, where k is the chordality of the graph, and we compute the treelength of meshes. More fundamentally we show that any algorithm computing a treedecomposition approximating the treewidth (or the treelength) of an nvertex graph by a factor α or less does not give an αapproximation of the treelength (resp. the treewidth) unless if α = Ω(n 1/5). We complete these results presenting several polynomial time constant approximate algorithms for the treelength. The introduction of this parameter is motivated by the design of compact distance labeling, compact routing tables with nearoptimal route length, and by the construction of sparse additive spanners.
Distance labeling in hyperbolic graphs
 In 16 th Annual International Symposium on Algorithms and Computation (ISAAC
, 2005
"... Abstract. A graph G is δhyperbolic if for any four vertices u, v, x,y of G the two larger of the three distance sums dG(u, v) + dG(x,y), dG(u, x) + dG(v, y),dG(u, y) + dG(v, x) differ by at most δ, and the smallest δ � 0 for which G is δhyperbolic is called the hyperbolicity of G. In this paper, w ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
Abstract. A graph G is δhyperbolic if for any four vertices u, v, x,y of G the two larger of the three distance sums dG(u, v) + dG(x,y), dG(u, x) + dG(v, y),dG(u, y) + dG(v, x) differ by at most δ, and the smallest δ � 0 for which G is δhyperbolic is called the hyperbolicity of G. In this paper, we construct a distance labeling scheme for bounded hyperbolicity graphs, that is a vertex labeling such that the distance between any two vertices of G can be estimated from their labels, without any other source of information. More precisely, our scheme assigns labels of O(log 2 n) bits for bounded hyperbolicity graphs with n vertices such that distances can be approximated within an additive error of O(log n). The label length is optimal for every additive error up to n ε. We also show a lower bound of Ω(log log n) on the approximation factor, namely every smultiplicative approximate distance labeling scheme on bounded hyperbolicity graphs with polylogarithmic labels requires s = Ω(log log n).
Reconstructing Approximate Tree Metrics
 Proceedings of the twentysixth ACM symposium on Principles of distributed computing
, 2007
"... We introduce a novel measure called εfourpoints condition (ε4PC), which assigns a value ε ∈ [0, 1] to every metric space quantifying how close the metric is to a tree metric. Datasets taken from real Internet measurements indicate remarkable closeness of Internet latencies to tree metrics based ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We introduce a novel measure called εfourpoints condition (ε4PC), which assigns a value ε ∈ [0, 1] to every metric space quantifying how close the metric is to a tree metric. Datasets taken from real Internet measurements indicate remarkable closeness of Internet latencies to tree metrics based on this condition. We study embeddings of ε4PC metric spaces into trees and prove tight upper and lower bounds. Specifically, we show that there are constants c1 and c2 such that, (1) every metric (X, d) which satisfies the ε4PC can be embedded into a tree with distortion (1 + ε) c1 log X, and (2) for every ε ∈ [0, 1] and any number of nodes, there is a metric space (X, d) satisfying the ε4PC that does not embed into a tree with distortion less than (1 + ε) c2 log X. In addition, we prove a lower bound on approximate distance labelings of ε4PC metrics, and give tight bounds for tree embeddings with additive error guarantees.
Local Computation of Nearly Additive Spanners
"... Abstract. An (α, β)spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two nodes u, v, dH(u, v) ≤ α ·dG(u, v)+β. This paper concerns algorithms for the distributed deterministic construction of a spar ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Abstract. An (α, β)spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two nodes u, v, dH(u, v) ≤ α ·dG(u, v)+β. This paper concerns algorithms for the distributed deterministic construction of a sparse (α, β)spanner H for a given graph G and distortion parameters α and β. It first presents a generic distributed algorithm that in constant number of rounds constructs, for every nnode graph and integer k ≥ 1, an (α, β)spanner of O(βn 1+1/k) edges, where α and β are constants depending on k. For suitable parameters, this algorithm provides a (2k − 1, 0)spanner of at most kn 1+1/k edges in k rounds, matching the performances of the best known distributed algorithm by Derbel et al. (PODC ’08). For k = 2 and constant ε> 0, it can also produce a (1+ε,2−ε)spanner of O(n 3/2) edges in constant time. More interestingly, for every integer k> 1, it can construct in constant time a (1 + ε, O(1/ε) k−2)spanner of O(ε −k+1 n 1+1/k) edges. Such deterministic
Interval Routing in Reliability Networks
, 2003
"... In this paper we consider routing with compact tables in reliability networks. ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
In this paper we consider routing with compact tables in reliability networks.
OPTIMAL DISTANCE LABELING FOR INTERVAL GRAPHS AND RELATED GRAPH FAMILIES
, 2008
"... A distance labeling scheme is a distributed graph representation that assigns labels to the vertices and enables answering distance queries between any pair (x, y) of vertices by using only the labels of x and y. This paper presents an optimal distance labeling scheme with labels of O(log n) bits f ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A distance labeling scheme is a distributed graph representation that assigns labels to the vertices and enables answering distance queries between any pair (x, y) of vertices by using only the labels of x and y. This paper presents an optimal distance labeling scheme with labels of O(log n) bits for the nvertex interval graphs family. It improves by log n factor the best known upper bound of [M. Katz, N. A. Katz, and D. Peleg, Distance labeling schemes for wellseparated