32 search results - page 2 / 7 » gd 2006 |
GD
2006
Springer
13 years 9 months ago
2006
Springer
GD
2006
Springer
13 years 9 months ago
2006
Springer
We give a brief account of results concerning the number of triangulations on finite point sets in the plane, both for arbitrary sets and for specific sets such as the n
GD
2006
Springer
13 years 9 months ago
2006
Springer
We 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 ...
GD
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
GD
2006
Springer
13 years 9 months ago
2006
Springer
We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs....