Force-Directed Drawing Algorithms

University of Arizona 5.

[1]  Mathieu Bastian,et al.  Gephi: An Open Source Software for Exploring and Manipulating Networks , 2009, ICWSM.

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

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

[4]  Michael Jünger,et al.  Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm , 2004, GD.

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

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

[7]  David Harel,et al.  An Algorithm for Straight-Line Drawing of Planar Graphs , 1995, Algorithmica.

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

[9]  Stephen G. Kobourov,et al.  GraphAEL: Graph Animations with Evolving Layouts , 2003, GD.

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

[11]  Helge J. Ritter,et al.  Hyperbolic Self-Organizing Maps for Semantic Navigation , 2001, NIPS.

[12]  Satoru Kawai,et al.  An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[13]  Stephen G. Kobourov,et al.  Exploring the computing literature using temporal graph visualization , 2004, IS&T/SPIE Electronic Imaging.

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

[15]  Ioannis G. Tollis,et al.  A framework for dynamic graph drawing , 1992, SCG '92.

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

[17]  Ulrik Brandes,et al.  Drawing on Physical Analogies , 2001, Drawing Graphs.

[18]  Andreas Noack,et al.  Energy Models for Graph Clustering , 2007, J. Graph Algorithms Appl..

[19]  Stephen C. North,et al.  Incremental Layout in DynaDAG , 1995, GD.

[20]  Emden R. Gansner,et al.  Graphviz - Open Source Graph Drawing Tools , 2001, GD.

[21]  Daniel W. Archambault,et al.  ImPrEd: An Improved Force‐Directed Algorithm that Prevents Nodes from Crossing Edges , 2011, Comput. Graph. Forum.

[22]  James W. Anderson,et al.  Hyperbolic geometry , 1999 .

[23]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[24]  David Eppstein,et al.  Lombardi Drawings of Graphs , 2010, J. Graph Algorithms Appl..

[25]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[26]  W. T. Tutte.  How to Draw a Graph , 1963 .

[27]  Sven Moen,et al.  Drawing dynamic trees , 1990, IEEE Software.

[28]  Peter J. Passmore,et al.  A User Study on Curved Edges in Graph Visualization , 2012, IEEE Transactions on Visualization and Computer Graphics.

[29]  Michael T. Goodrich,et al.  A Fast Multi-Dimensional Algorithm for Drawing Large Graphs? , 2000 .

[30]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[31]  Stephan Diehl,et al.  Graphs, They Are Changing , 2002, GD.

[32]  Michael T. Goodrich,et al.  A multi-dimensional approach to force-directed layouts of large graphs , 2000, Comput. Geom..

[33]  Ben Shneiderman,et al.  Focus + context , 1999 .

[34]  Yehuda Koren,et al.  Graph Drawing by Stress Majorization , 2004, GD.

[35]  Peter Eades,et al.  Drawing Stressed Planar Graphs in Three Dimensions , 1995, GD.

[36]  Christian S. Collberg,et al.  A system for graph-based visualization of the evolution of software , 2003, SoftVis '03.

[37]  Michael D. Vose,et al.  The simple genetic algorithm - foundations and theory , 1999, Complex adaptive systems.

[38]  Clifford J. Fisk,et al.  “ACCEL” automated circuit card etching layout , 1965, DAC.

[39]  L. Greengard.  The Rapid Evaluation of Potential Fields in Particle Systems , 1988 .

[40]  Tamara Munzner,et al.  H3: laying out large directed graphs in 3D hyperbolic space , 1997, Proceedings of VIZ '97: Visualization Conference, Information Visualization Symposium and Parallel Rendering Symposium.

[41]  Alla Sheffer,et al.  Fundamentals of spherical parameterization for 3D meshes , 2003, ACM Trans. Graph..

[42]  Tamara Munzner,et al.  Drawing Large Graphs with H3Viewer and Site Manager , 1998, GD.

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

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

[45]  Stephen G. Kobourov,et al.  Visualizing the behavior of dynamically modifiable code , 2005, 13th International Workshop on Program Comprehension (IWPC'05).

[46]  J. Kruskal.  Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis , 1964 .

[47]  Ioannis G. Tollis,et al.  Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs , 1995, SIAM J. Comput..

[48]  H. Ritter.  Self-Organizing Maps on non-euclidean Spaces , 1999 .

[49]  David Eppstein,et al.  Drawing Trees with Perfect Angular Resolution and Polynomial Area , 2013, Discret. Comput. Geom..

[50]  Stephen G. Kobourov,et al.  Non-Euclidean Spring Embedders , 2005, IEEE Trans. Vis. Comput. Graph..

[51]  Kim Marriott,et al.  Constrained graph layout by stress majorization and gradient projection , 2009, Discret. Math..

[52]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[53]  Ulrik Brandes,et al.  Eigensolver Methods for Progressive Multidimensional Scaling of Large Data , 2006, GD.

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

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

[56]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[57]  Ramana Rao,et al.  A focus+context technique based on hyperbolic geometry for visualizing large hierarchies , 1995, CHI '95.

[58]  Jarke J. van Wijk,et al.  A model for smooth viewing and navigation of large 2D information spaces , 2004, IEEE Transactions on Visualization and Computer Graphics.

[59]  Erkki Mäkinen,et al.  TimGA - A Genetic Algorithm for Drawing Undirected Graphs , 1996 .

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

[61]  François Bertault,et al.  A force-directed algorithm that preserves edge-crossing properties , 1999, Inf. Process. Lett..

[62]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[63]  Armand Navabi,et al.  Graphael: A System for Generalized Force-Directed Layouts , 2004, GD.

[64]  Stephen G. Kobourov,et al.  On the Usability of Lombardi Graph Drawings , 2012, Graph Drawing.

[65]  Stephen G. Kobourov,et al.  Planar Preprocessing for Spring Embedders , 2012, Graph Drawing.

[66]  Roberto Tamassia,et al.  Curvilinear Graph Drawing Using the Force-Directed Method , 2004, GD.

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

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

[69]  J. Geelen.  ON HOW TO DRAW A GRAPH , 2012 .

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

[71]  Michael T. Goodrich,et al.  Force-Directed Lombardi-Style Graph Drawing , 2011, Graph Drawing.

[72]  Tamara Munzner,et al.  Visualizing the structure of the World Wide Web in 3D hyperbolic space , 1995, VRML '95.

[73]  Yifan Hu,et al.  Efficient, High-Quality Force-Directed Graph Drawing , 2006 .

[74]  Joe Marks,et al.  A Parallel Genetic Algorithm for Network-Diagram Layout , 1991, ICGA.