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

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

Documents Related by Co-Citation

132 KM: An r-dimensional quadratic placement algorithm – Hall - 1970
361 An algorithm for drawing general undirected graph – T Kamada, S Kawai - 1989
149 Drawing Graphs Nicely Using Simulated Annealing – Ron Davidson, David Harel - 1996
341 Graph Drawing by Force-directed Placement – Thomas M. J. Fruchterman, Edward, Edward M. Reingold - 1991
69 A Multilevel Algorithm for Force-Directed Graph-Drawing – Chris Walshaw - 2003
79 Reingold E: Graph drawing by force-directed placement – T Fruchterman - 1991
34 A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs – Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov - 2000
444 A Framework for Dynamic Graph Drawing – Robert F. Cohen, G. Di Battista, R. Tamassia, Ioannis G. Tollis - 1992
68 A Fast Multi-Scale Method for Drawing Large Graphs – David Harel, Yehuda Koren - 2002
11 Visualizing and Classifying Odors Using a Similarity Matrix – Liran Carmel, Yehuda Koren - 2002
36 D.: Drawing Graphs – M Kaufmann, Wagner - 2001
74 Applied Multivariate Data Analysis – S Brian, G Dunn - 2001
35 On Spectral Graph Drawing – Yehuda Koren - 2002
314 HOW TO DRAW A Graph – W. T. Tutte - 1963
22 A Hybrid Layout Algorithm for Sub-Quadratic Multidimensional Scaling – Alistair Morrison, Greg Ross, Matthew Chalmers - 2002
113 The Laplacian spectrum of graphs – Bojan Mohar - 1991
15 A Numerical Optimization Approach to General Graph Drawing – Daniel Tunkelang - 1999
47 Graph Drawing by High-Dimensional Embedding – David Harel, Yehuda Koren - 2002
24 Visualization of Bibliographic Networks with a Reshaped Landscape Metaphor – U. Brandes, T. Willhalm - 2002