A multi-dimensional approach to force-directed layouts of large graphs

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  M. Garey.  Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

[3]  N. Quinn,et al.  A forced directed component placement procedure for printed circuit boards , 1979 .

[4]  J. G. Hollands,et al.  Engineering Psychology and Human Performance , 1984 .

[5]  Peter Eades,et al.  A Heuristic for Graph Drawing , 1984 .

[6]  Teofilo F. GONZALEZ,et al.  Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..

[7]  G. W. Furnas,et al.  Generalized fisheye views , 1986, CHI '86.

[8]  David B. Shmoys,et al.  A unified approach to approximation algorithms for bottleneck problems , 1986, JACM.

[9]  Piet Hut,et al.  A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.

[10]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[11]  Kozo Sugiyama,et al.  Visualization of structural information: automatic drawing of compound digraphs , 1991, IEEE Trans. Syst. Man Cybern..

[12]  A. Brandt.  Multilevel computations of integral transforms and particle interactions with oscillatory kernels , 1991 .

[13]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[14]  A. Brandt.  Multigrid methods in lattice field computations , 1992, hep-lat/9204014.

[15]  Colin Ware,et al.  Visualizing object oriented software in three dimensions , 1993, CASCON.

[16]  Manojit Sarkar,et al.  Graphical fisheye views , 1994, CACM.

[17]  Andreas Ludwig,et al.  A Fast Adaptive Layout Algorithm for Undirected Graphs , 1994, GD.

[18]  Alvis Brazma,et al.  A Simple Algorithm for Drawing Large Graphs on Small Screens , 1994, Graph Drawing.

[19]  Ioannis G. Tollis,et al.  Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[20]  Burkhard Monien,et al.  A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs , 1995, GD.

[21]  Arne Frick,et al.  Fast Interactive 3-D Graph Visualization , 1995, GD.

[22]  Isabel F. Cruz,et al.  3D Graph Drawing with Simulated Annealing , 1995, GD.

[23]  Robert F. Cohen,et al.  How to Draw a Planar Clustered Graph , 1995, COCOON.

[24]  David Harel,et al.  Drawing graphs nicely using simulated annealing , 1996, TOGS.

[25]  Peter Eades,et al.  Multilevel Visualization of Clustered Graphs , 1996, GD.

[26]  Antonios Symvonis,et al.  Two Algorithms for Three Dimensional Orthogonal Graph Drawing , 1996, GD.

[27]  Diethelm Ostry,et al.  Some Three-Dimensional Graph Drawing Algorithms , 1996 .

[28]  Ioannis G. Tollis,et al.  Incremental Orthogonal Graph Drawing in Three Dimensions , 1997, GD.

[29]  Jonathan D. Cohen,et al.  Drawing graphs to convey proximity: an incremental arrangement method , 1997, TCHI.

[30]  Therese C. Biedl,et al.  Three Approaches to 3D-Orthogonal Box-Drawings , 1998, GD.

[31]  Daniel Tunkelang,et al.  JIGGLE: Java Interactive Graph Layout Environment , 1998, GD.

[32]  Michael T. Goodrich,et al.  Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs , 1998, GD.

[33]  Emden R. Gansner,et al.  Improved Force-Directed Layouts , 1998, GD.

[34]  David R. Wood,et al.  Multi-dimensional Orthogonal Graph Drawing with Small Boxes , 1999, GD.

[35]  David Harel,et al.  A multi-scale algorithm for drawing graphs nicely , 1999, Discret. Appl. Math..

[36]  Stephen G. Kobourov,et al.  Journal of Graph Algorithms and Applications Grip: Graph Drawing with Intelligent Placement , 2022 .

[37]  Michael T. Goodrich,et al.  Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs , 2000, J. Graph Algorithms Appl..

[38]  David Harel,et al.  A fast multi-scale method for drawing large graphs , 2000, AVI '00.

[39]  Chris Walshaw,et al.  Journal of Graph Algorithms and Applications a Multilevel Algorithm for Force-directed Graph-drawing , 2022 .

[40]  Peter Eades,et al.  FADE: Graph Drawing, Clustering, and Visual Abstraction , 2000, GD.

[41]  Colin Ware,et al.  Information Visualization: Perception for Design , 2000 .

[42]  Michael Kaufmann,et al.  Drawing graphs: methods and models , 2001 .

[43]  Ganesh S. Oak.  Information Visualization Introduction , 2022 .

[44]  Hiroshi Nagamochi,et al.  Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs , 1996, Algorithmica.