605 search results - page 8 / 121 » Constrained Graph Layout |
ENDM
2010
13 years 10 months ago
2010
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
JGAA
2007
13 years 9 months ago
2007
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
IV
2006
IEEE
14 years 3 months ago
2006
IEEE
We present interactive visual aids to support the exploration and navigation of graph layouts. They include Fisheye Tree Views and Composite Lenses. These views provide, in an int...
WG
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
GD
1995
Springer
14 years 1 months ago
1995
Springer
Abstract. When adjusting a graph layout, it is often desirable to preserve various properties of the original graph in the adjusted view. Pertinent properties may include straightn...