|
361
|
An algorithm for drawing general undirected graph
– T Kamada, S Kawai
- 1989
|
|
69
|
A Multilevel Algorithm for Force-Directed Graph-Drawing
– Chris Walshaw
- 2003
|
|
34
|
A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs
– Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov
- 2000
|
|
341
|
Graph Drawing by Force-directed Placement
– Thomas M. J. Fruchterman, Edward, Edward M. Reingold
- 1991
|
|
16
|
An experimental comparison of fast algorithms for drawing general large graphs
– Stefan Hachul, Michael Jünger
- 2005
|
|
56
|
ACE: A Fast Multiscale Eigenvector Computation for Drawing Huge Graphs
– Yehuda Koren, Liran Carmel, David Harel
- 2002
|
|
86
|
A fast adaptive layout algorithm for undirected graphs
– Arne Frick, Andreas Ludwig, Heiko Mehldau
- 1995
|
|
68
|
A Fast Multi-Scale Method for Drawing Large Graphs
– David Harel, Yehuda Koren
- 2002
|
|
132
|
KM: An r-dimensional quadratic placement algorithm
– Hall
- 1970
|
|
24
|
Drawing huge graphs by algebraic multigrid optimization. Multiscale Modeling and Simulation
– Yehuda Koren, Liran Carmel, David Harel
- 2003
|
|
29
|
GRIP: Graph dRawing with Intelligent Placement -- Short System Demonstration
– Pawel Gajer, Stephen G. Kobourov
|
|
29
|
S.: Topological fisheye views for visualizing large graphs
– E GANSNER, Y KOREN, NORTH
|
|
22
|
Drawing large graphs with a potential-fieldbased multilevel algorithm (extended abstract
– S Hachul, M Jünger
- 2004
|
|
35
|
On Spectral Graph Drawing
– Yehuda Koren
- 2002
|
|
444
|
A Framework for Dynamic Graph Drawing
– Robert F. Cohen, G. Di Battista, R. Tamassia, Ioannis G. Tollis
- 1992
|
|
149
|
Drawing Graphs Nicely Using Simulated Annealing
– Ron Davidson, David Harel
- 1996
|
|
31
|
FADE: Graph drawing, clustering, and visual abstraction
– A J QUIGLEY, P EADES
- 1984
|
|
1824
|
Normalized Cuts and Image Segmentation
– Jianbo Shi, Jitendra Malik
- 2000
|
|
314
|
HOW TO DRAW A Graph
– W. T. Tutte
- 1963
|