81 search results - page 1 / 17 » A Fast Adaptive Layout Algorithm for Undirected Graphs |
GD
1994
Springer
14 years 3 months ago
1994
Springer
d Abstract and System Demonstration) Arne Frick , Andreas Ludwig, Heiko Mehldau Universit
GD
1995
Springer
14 years 2 months ago
1995
Springer
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...
GD
2000
Springer
14 years 2 months ago
2000
Springer
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graph...
CONSTRAINTS
1998
13 years 10 months ago
1998
Most current graph layout technology does not lend itself to interactive applications such as animation or advanced user interfaces. We introduce the constrained graph layout model...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...