|
69
|
A Multilevel Algorithm for Force-Directed Graph-Drawing
– Chris Walshaw
- 2003
|
|
361
|
An algorithm for drawing general undirected graph
– T Kamada, S Kawai
- 1989
|
|
341
|
Graph Drawing by Force-directed Placement
– Thomas M. J. Fruchterman, Edward, Edward M. Reingold
- 1991
|
|
68
|
A Fast Multi-Scale Method for Drawing Large Graphs
– David Harel, 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
|
|
56
|
ACE: A Fast Multiscale Eigenvector Computation for Drawing Huge Graphs
– Yehuda Koren, Liran Carmel, David Harel
- 2002
|
|
47
|
Graph Drawing by High-Dimensional Embedding
– David Harel, Yehuda Koren
- 2002
|
|
31
|
FADE: Graph drawing, clustering, and visual abstraction
– A J QUIGLEY, P EADES
- 1984
|
|
132
|
KM: An r-dimensional quadratic placement algorithm
– Hall
- 1970
|
|
42
|
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms
– Franz J. Brandenburg, Michael Himsolt, Christoph Rohrer
- 1996
|
|
1824
|
Normalized Cuts and Image Segmentation
– Jianbo Shi, Jitendra Malik
- 2000
|
|
79
|
Reingold E: Graph drawing by force-directed placement
– T Fruchterman
- 1991
|
|
15
|
A Numerical Optimization Approach to General Graph Drawing
– Daniel Tunkelang
- 1999
|
|
57
|
editors. Drawing Graphs: Methods and Models
– Michael Kaufmann, Dorothea Wagner
|
|
86
|
A fast adaptive layout algorithm for undirected graphs
– Arne Frick, Andreas Ludwig, Heiko Mehldau
- 1995
|
|
8
|
A Multi-Scale Method for Drawing Graphs
– R Hadany, D Harel
|
|
35
|
GraphAEL: Graph Animations with Evolving Layouts
– C. Erten, P. J. Harding, S. G. Kobourov, K. Wampler, G. Yee
- 2003
|
|
24
|
Visualization of Bibliographic Networks with a Reshaped Landscape Metaphor
– U. Brandes, T. Willhalm
- 2002
|
