APVIS
2006
13 years 5 months ago
2006
A common problem in visualising some networks is the presence of localised high density areas in an otherwise sparse graph. Applying common graph drawing algorithms on such networ...
GD
2006
Springer
13 years 8 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,...
ACSC
2004
IEEE
13 years 8 months ago
2004
IEEE
Graph drawing is an important area of information visualization which concerns itself with the visualization of relational data structures. Relational data like networks, hierarch...
GD
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Many graph drawing algorithms use st-numberings (st-orientations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a d...