141 search results - page 3 / 29 » Layout Problems on Lattice Graphs |
WG
1999
Springer
13 years 10 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...
PPL
2000
13 years 5 months ago
2000
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...
ENDM
2010
13 years 6 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...
COCOON
2006
Springer
13 years 10 months ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
APVIS
2007
13 years 7 months ago
2007
In this paper, we consider the problem of navigating graphs drawn in 2.5 dimensions. First, we define criteria for good navigation and then present various methods to satisfy som...