Add to ORKGGiven a set S of n points in the plane, a minimumdilation spanning tree of S is a tree with vertex set S of smallest possible dilation. We show that given a set S of n points and a dilation δ> 1, it is NP-hard to determine whether a spanning tree of S with dilation at most δ exists.
Given a set S of points in the plane, a geometric network for S is a graph G with vertex set S and s...
Let G be a graph with n vertices which is embedded in Euclidean space R d. For any two vertices of G...
The minimal spanning tree problem is one of the oldest and most basic graph problems in theoretical ...
Given a set S of n points in the plane, a minimum-dilation spanning tree of S is a tree with vertex ...
AbstractIn a geometric network G=(S,E), the graph distance between two vertices u,v∈S is the length ...
Consider a geometric graph G, drawn with straight lines in the plane. For every pair a,b of vertices...
Consider a geometric graph $G$, drawn with straight lines in the plane. For every pair $a$,$b$ of ve...
AbstractGiven n points in the Euclidean plane, the degree-δ minimum spanning tree (MST) problem asks...
Given n points in the plane, the degree-K span-ning tree problem asks for a spanning tree of min-imu...
Given n points in the plane, the degree-K spanning-tree problem asks for a spanning tree of minimum ...
: We consider the problem of constructing a spanning tree for a graph G = (V, E) with n vertices an...
Given n points in the plane, the degree-K spanning tree problem asks for a spanning tree of minimum ...
AbstractThe minimum vertex ranking spanning tree problem (MVRST) is to find a spanning tree of G who...
We prove that the problem of finding, in an undirected graph with non-negative costs on edges, a min...
Spanning trees have always been of great interest in various areas of com-puter science. The same is...
Given a set S of points in the plane, a geometric network for S is a graph G with vertex set S and s...
Let G be a graph with n vertices which is embedded in Euclidean space R d. For any two vertices of G...
The minimal spanning tree problem is one of the oldest and most basic graph problems in theoretical ...
Given a set S of n points in the plane, a minimum-dilation spanning tree of S is a tree with vertex ...
AbstractIn a geometric network G=(S,E), the graph distance between two vertices u,v∈S is the length ...
Consider a geometric graph G, drawn with straight lines in the plane. For every pair a,b of vertices...
Consider a geometric graph $G$, drawn with straight lines in the plane. For every pair $a$,$b$ of ve...
AbstractGiven n points in the Euclidean plane, the degree-δ minimum spanning tree (MST) problem asks...
Given n points in the plane, the degree-K span-ning tree problem asks for a spanning tree of min-imu...
Given n points in the plane, the degree-K spanning-tree problem asks for a spanning tree of minimum ...
: We consider the problem of constructing a spanning tree for a graph G = (V, E) with n vertices an...
Given n points in the plane, the degree-K spanning tree problem asks for a spanning tree of minimum ...
AbstractThe minimum vertex ranking spanning tree problem (MVRST) is to find a spanning tree of G who...
We prove that the problem of finding, in an undirected graph with non-negative costs on edges, a min...
Spanning trees have always been of great interest in various areas of com-puter science. The same is...
Given a set S of points in the plane, a geometric network for S is a graph G with vertex set S and s...
Let G be a graph with n vertices which is embedded in Euclidean space R d. For any two vertices of G...
The minimal spanning tree problem is one of the oldest and most basic graph problems in theoretical ...