Node overlap removal in clustered directed acyclic graphs

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

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

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

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

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

[6]  Robert F. Cohen,et al.  Validating Graph Drawing Aesthetics , 1995, GD.

[7]  Kozo Sugiyama,et al.  Layout Adjustment and the Mental Map , 1995, J. Vis. Lang. Comput..

[8]  C. Yeh,et al.  Technique to minimise area overhead for delay-driven clustering , 1995 .

[9]  Xuemin Lin,et al.  Spring algorithms and symmetry , 1997, Theor. Comput. Sci..

[10]  Ioannis G. Tollis,et al.  A unified approach to labeling graphical features , 1998, SCG '98.

[11]  Peter Eades,et al.  On-line Animated Visualization of Huge Graphs using a Modified Spring Algorithm , 1998, J. Vis. Lang. Comput..

[12]  David P. Dobkin,et al.  Uncluttering force-directed graph layouts , 1999, SCG '99.

[13]  Peter Eades,et al.  Journal of Graph Algorithms and Applications Navigating Clustered Graphs Using Force-directed Methods , 2022 .

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

[15]  Ivan Herman,et al.  Density functions for visual attributes and effective partitioning in graph visualization , 2000, IEEE Symposium on Information Visualization 2000. INFOVIS 2000. Proceedings.

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

[17]  Wei Lai,et al.  Layout adjustment and boundary detection for a diagram , 2001, Proceedings. Computer Graphics International 2001.

[18]  K. J. Pulo.  Recursive Space Decompositions in Force-Directed Graph Drawing Algorithms , 2001, InVis.au.

[19]  Peter Eades,et al.  Removing edge-node intersections in drawings of graphs , 2002, Inf. Process. Lett..

[20]  Michael Stepp,et al.  Growing fat graphs , 2002, SCG '02.

[21]  Peter Eades,et al.  User Hints for Map Labelling , 2003, ACSC.

[22]  Kevin B. Korb,et al.  Bayesian Artificial Intelligence , 2004, Computer science and data analysis series.

[23]  Edward M Marcotte,et al.  LGL: creating a map of protein function with an algorithm for visualizing very large biological networks. , 2004, Journal of molecular biology.

[24]  Peter Rodgers,et al.  Applying graphical design techniques to graph visualisation , 2005, Ninth International Conference on Information Visualisation (IV'05).

[25]  Peter Eades,et al.  Navigating software architectures with constant visual complexity , 2005, 2005 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC'05).

[26]  Peter Eades,et al.  Using Spring Algorithms to Remove Node Overlapping , 2005, APVIS.

[27]  Jeffrey Heer,et al.  prefuse: a toolkit for interactive information visualization , 2005, CHI.

[28]  Junbin Gao,et al.  A new algorithm for removing node overlapping in graph visualization , 2007, Inf. Sci..

[29]  Kang Zhang,et al.  Social Network Analysis of Online Marketplaces , 2007 .

[30]  Kang Zhang,et al.  Visualization of Clustered Directed Acyclic Graphs without Node Overlapping , 2008, 2008 12th International Conference Information Visualisation.

[31]  Kang Zhang,et al.  Visualization of clustered directed acyclic graphs with node interleaving , 2009, SAC '09.