Add to ORKGWe prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if edge crossings are allowed or forbidden. We also show that the problem remains NP-hard even when a minimum-dilation tour or path is sought; not even an FPTAS exists in this case
Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs tha...
AbstractGiven a set S of n points in RD, and an integer k such that 0⩽k<n, we show that a geometric ...
Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard g...
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...
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 ge...
AbstractIn a geometric network G=(S,E), the graph distance between two vertices u,v∈S is the length ...
Let G(P) = (P,E) be the geometric graph associated to a given set P of points in the plane, i.e., t...
Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs tha...
Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs tha...
AbstractGiven a set S of n points in RD, and an integer k such that 0⩽k<n, we show that a geometric ...
Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard g...
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...
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 ge...
AbstractIn a geometric network G=(S,E), the graph distance between two vertices u,v∈S is the length ...
Let G(P) = (P,E) be the geometric graph associated to a given set P of points in the plane, i.e., t...
Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs tha...
Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs tha...
AbstractGiven a set S of n points in RD, and an integer k such that 0⩽k<n, we show that a geometric ...
Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard g...