|
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
|
|
149
|
Drawing Graphs Nicely Using Simulated Annealing
– Ron Davidson, David Harel
- 1996
|
|
444
|
A Framework for Dynamic Graph Drawing
– Robert F. Cohen, G. Di Battista, R. Tamassia, Ioannis G. Tollis
- 1992
|
|
34
|
A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs
– Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov
- 2000
|
|
56
|
ACE: A Fast Multiscale Eigenvector Computation for Drawing Huge Graphs
– Yehuda Koren, Liran Carmel, David Harel
- 2002
|
|
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
|
|
341
|
Graph Drawing by Force-directed Placement
– Thomas M. J. Fruchterman, Edward, Edward M. Reingold
- 1991
|
|
79
|
Reingold E: Graph drawing by force-directed placement
– T Fruchterman
- 1991
|
|
18
|
Generating customized layouts
– X WANG, I MIYAMOTO
- 1996
|
|
20
|
Visual Ranking of Link Structures
– Ulrik Brandes, Sabine Cornelsen
- 2003
|
|
42
|
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms
– Franz J. Brandenburg, Michael Himsolt, Christoph Rohrer
- 1996
|
|
31
|
FADE: Graph drawing, clustering, and visual abstraction
– A J QUIGLEY, P EADES
- 1984
|
|
26
|
Fast interactive 3-D graph visualization
– I BRUss, A FRICK
- 1997
|
|
28
|
Designing network diagrams
– J Kruskal, J Seery
- 1980
|
|
283
|
Graph Drawing – Algorithms for the Visualization of Graphs
– G Di Battista, P Eades, R Tamassia, I G Tollis
- 1999
|
|
32
|
Graph Partitioning Algorithms With Applications To Scientific Computing
– Alex Pothen
- 1997
|
|
175
|
Recent Directions in Netlist Partitioning: A Survey
– Charles J. Alpert, Andrew B. Kahng
|
