41 search results - page 1 / 9 » A Note on Distance Approximating Trees in Graphs |
EJC
2000
13 years 5 months ago
2000
ALGORITHMICA
2010
13 years 5 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
SIAMCOMP
2000
13 years 5 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
SAGA
2007
Springer
13 years 11 months ago
2007
Springer
In the layered-graph query model of network discovery, a query at a node v of an undirected graph G discovers all edges and non-edges whose endpoints have different distance from ...