Documents Related by Co-Citation

431 Graph Drawing by Force-directed Placement – Thomas M. J. Fruchterman, Edward, Edward M. Reingold - 1991
80 A Fast Multi-Scale Method for Drawing Large Graphs – David Harel, Yehuda Koren - 2002
456 An algorithm for drawing general undirected graphs – Tomihisa Kamada, Satoru Kawai - 1989
36 A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs – Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov - 2000
520 A Framework for Dynamic Graph Drawing – Robert F. Cohen, G. Di Battista, R. Tamassia, Ioannis G. Tollis - 1992
59 Graph Drawing by High-Dimensional Embedding – David Harel, Yehuda Koren - 2002
174 Drawing Graphs Nicely Using Simulated Annealing – Ron Davidson, David Harel - 1996
160 An r-dimensional quadratic placement algorithm. Management Science, 17:219 – 229 – K M Hall - 1970
43 P.: FADE: graph drawing, clustering, and visual abstraction – A Quigley, Eades
44 An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms – Franz J. Brandenburg, Michael Himsolt, Christoph Rohrer - 1996
63 ACE: A Fast Multiscale Eigenvector Computation for Drawing Huge Graphs – Yehuda Koren, Liran Carmel, David Harel - 2002
103 A fast adaptive layout algorithm for undirected graphs – Arne Frick, Andreas Ludwig, Heiko Mehldau - 1995
333 Graph Drawing: Algorithms for the visualization of graphs – G Di Battista, P Eades, R Tamassia, I G Tollis - 1999
2590 Normalized Cuts and Image Segmentation – Jianbo Shi, Jitendra Malik - 2000
34 Drawing large graphs with a potential-field-based multilevel algorithm – S Hachul, M Jünger - 2004
797 A fast and high quality multilevel scheme for partitioning irregular graphs – George Karypis, Vipin Kumar - 1998
8 A Multi-Scale Method for Drawing Graphs – R Hadany, D Harel - 2001
105 Graph drawing by force-directed placement. Software - Practice and Experience 21.11 – T M J Fruchterman, E M Reingold - 1991
63 Drawing Graphs, methods and models – M WEGENER KAUFMANN, D - 2001