Sciweavers

113 search results - page 3 / 23
» A Fast Multi-scale Method for Drawing Large Graphs
Sort
View
INFOVIS
2002
IEEE
13 years 10 months ago
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
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...
Yehuda Koren, Liran Carmel, David Harel
GD
2009
Springer
13 years 10 months ago
Fast Edge-Routing for Large Graphs
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area...
Tim Dwyer, Lev Nachmanson
ACSC
2004
IEEE
13 years 9 months ago
Flexible Layering in Hierarchical Drawings with Nodes of Arbitrary Size
Graph drawing is an important area of information visualization which concerns itself with the visualization of relational data structures. Relational data like networks, hierarch...
Carsten Friedrich, Falk Schreiber
GD
2004
Springer
13 years 10 months ago
Drawing Power Law Graphs
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
Reid Andersen, Fan R. K. Chung, Lincoln Lu
GD
2007
Springer
13 years 11 months ago
Drawing Graphs with GLEE
This paper describes novel methods we developed to lay out graphs using Sugiyama’s scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph ...
Lev Nachmanson, George G. Robertson, Bongshin Lee