514 search results - page 18 / 103 » Drawing a Graph in a Hypercube |
GD
2003
Springer
14 years 19 days ago
2003
Springer
Abstract. In this manuscript, we present several challenging and interesting open problems in graph drawing. The goal of the listing in this paper is to stimulate future research i...
CONSTRAINTS
1998
13 years 7 months ago
1998
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
GD
2007
Springer
14 years 1 months ago
2007
Springer
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this ...
DCG
2010
13 years 7 months ago
2010
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this...
INFOVIS
2002
IEEE
14 years 10 days ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...