5889 search results - page 1 / 1178 » Graph Layout Problems |
ACSC
2005
IEEE
13 years 11 months ago
2005
IEEE
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
GD
2003
Springer
13 years 10 months ago
2003
Springer
We address the new problem of puzzle layout as a new application of awing. We present two abstract models of puzzles, permutation puzzles and cyclic puzzles, which can be modeled a...
WG
1999
Springer
13 years 9 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...
COCOON
1999
Springer
13 years 9 months ago
1999
Springer
MFCS
1992
Springer
13 years 9 months ago
1992
Springer
