326 search results - page 6 / 66 » A Library of Algorithms for Graph Drawing |
CCCG
1998
13 years 8 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
GD
2003
Springer
14 years 18 days ago
2003
Springer
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same node set. We present three algorithms...
GD
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
ISAAC
2004
Springer
14 years 22 days ago
2004
Springer
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner ...
GD
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The GRIP system is designed for drawing large graphs and uses a novel multi-dimensional ...