Add to ORKGThe dilation of a Euclidean graph is defined as the ratio of distance in the graph divided by distance in R-d. In this paper we consider the problem of positioning the root of a star such that the dilation of the resulting star is minimal. We present a deterministic O(n log n)-time algorithm for evaluating the dilation of a given star; a randomized O(n log n) expected-time algorithm for finding an optimal center in R^d; and for the case d = 2, a randomized O(n2(alpha(n)) log(2) n) expected-time algorithm for finding an optimal center among the input points
Consider a geometric graph G, drawn with straight lines in the plane. For every pair a,b of vertices...
In a geometric network G=(S,E), the graph distance between two vertices u,vS is the length of the sh...
Given a set S of n points in the plane, and an integer k such that 0 = k <n, we show that a geome...
AbstractThe dilation of a Euclidean graph is defined as the ratio of distance in the graph divided b...
AbstractThe dilation of a geometric graph is the maximum, over all pairs of points in the graph, of ...
Let G be a graph with n vertices which is embedded in Euclidean space R d. For any two vertices of G...
AbstractLet G be a graph with n vertices which is embedded in Euclidean space Rd. For any two vertic...
Let G(P) = (P,E) be the geometric graph associated to a given set P of points in the plane, i.e., t...
Let G be a graph embedded in Euclidean space. For any two vertices of G their dilation denotes the l...
Consider a geometric network G in the plane. The dilation between any two vertices x and y in G is t...
Given a planar graph G, thegraph theoretic dilation of G is defined as the maximum ratio of the shor...
Consider a geometric network G in the plane. The dilation between any two vertices x and y in G is t...
The complexity status of the Minimum Dilation Triangulation (MDT) problem for a general point set i...
Consider a geometric graph $G$, drawn with straight lines in the plane. For every pair $a$,$b$ of ve...
Consider a geometric graph G, drawn with straight lines in the plane. For every pair a,b of vertices...
In a geometric network G=(S,E), the graph distance between two vertices u,vS is the length of the sh...
Given a set S of n points in the plane, and an integer k such that 0 = k <n, we show that a geome...
AbstractThe dilation of a Euclidean graph is defined as the ratio of distance in the graph divided b...
AbstractThe dilation of a geometric graph is the maximum, over all pairs of points in the graph, of ...
Let G be a graph with n vertices which is embedded in Euclidean space R d. For any two vertices of G...
AbstractLet G be a graph with n vertices which is embedded in Euclidean space Rd. For any two vertic...
Let G(P) = (P,E) be the geometric graph associated to a given set P of points in the plane, i.e., t...
Let G be a graph embedded in Euclidean space. For any two vertices of G their dilation denotes the l...
Consider a geometric network G in the plane. The dilation between any two vertices x and y in G is t...
Given a planar graph G, thegraph theoretic dilation of G is defined as the maximum ratio of the shor...
Consider a geometric network G in the plane. The dilation between any two vertices x and y in G is t...
The complexity status of the Minimum Dilation Triangulation (MDT) problem for a general point set i...
Consider a geometric graph $G$, drawn with straight lines in the plane. For every pair $a$,$b$ of ve...
Consider a geometric graph G, drawn with straight lines in the plane. For every pair a,b of vertices...
In a geometric network G=(S,E), the graph distance between two vertices u,vS is the length of the sh...
Given a set S of n points in the plane, and an integer k such that 0 = k <n, we show that a geome...