ACE: A Fast Multiscale Eigenvector Computation for Drawing Huge Graphs (2002)

by Yehuda Koren , Liran Carmel , David Harel
Citations:62 - 13 self

Documents Related by Co-Citation

160 An r-dimensional quadratic placement algorithm. Management Science, 17:219 – 229 – K M Hall - 1970
456 An algorithm for drawing general undirected graphs – Tomihisa Kamada, Satoru Kawai - 1989
431 Graph Drawing by Force-directed Placement – Thomas M. J. Fruchterman, Edward, Edward M. Reingold - 1991
89 A Multilevel Algorithm for Force-Directed Graph-Drawing – Chris Walshaw - 2003
80 A Fast Multi-Scale Method for Drawing Large Graphs – David Harel, Yehuda Koren - 2002
36 A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs – Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov - 2000
174 Drawing Graphs Nicely Using Simulated Annealing – Ron Davidson, David Harel - 1996
151 The Laplacian spectrum of graphs – Bojan Mohar - 1991
7 A Multi-Scale Method for Drawing Graphs Nicely – R Hadany, D Harel - 2001
520 A Framework for Dynamic Graph Drawing – Robert F. Cohen, G. Di Battista, R. Tamassia, Ioannis G. Tollis - 1992
11 Visualizing and Classifying Odors Using a Similarity Matrix – Liran Carmel, Yehuda Koren - 2002
91 Applied Multivariate Data Analysis – S Brian, G Dunn - 2001
40 Drawing Graphs – M Kaufmann, D Wagner
26 A Hybrid Layout Algorithm for Sub-Quadratic Multidimensional Scaling – Alistair Morrison, Greg Ross, Matthew Chalmers - 2002
56 Optimal linear labelings and eigenvalues of graphs – M Juvan, B Mohar - 1992
87 A Linear Iteration Time Layout Algorithm for Visualising High–Dimensional Data – M Chalmers - 1996
19 A Numerical Optimization Approach to General Graph Drawing – Daniel Tunkelang - 1999
105 Graph drawing by force-directed placement. Software - Practice and Experience 21.11 – T M J Fruchterman, E M Reingold - 1991
26 Visualization of Bibliographic Networks with a Reshaped Landscape Metaphor – U. Brandes, T. Willhalm - 2002