From Tree to Graph - Experiments with E-Spring Algorithm

Graph drawing and visualization represent structural information as diagrams of abstract graphs and networks. E-Spring Algorithm, derived from the popular spring embedder model, was proposed to eliminate node overlaps in the drawings of clustered directed acyclic graphs Gc. In this paper, we apply the E-Spring algorithm to general graphs by minimizing edge-node intersections. Initially, a tree structure is extracted from the original graph using the breadth-first search (BFS) algorithm. The extracted tree is then visualized without node overlaps using the E-Spring algorithm, and the remaining non-tree edges are appended to this visualization. A post-processing step that implements edge routing is performed on the obtained visualization to eliminate residual edge-node intersections. This method has been validated by visualizing eBay buyer-seller relationships and Graph Catalog benchmarking data.

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

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

[3]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[4]  Victor O. K. Li,et al.  Finding minimum rectilinear distance paths in the presence of barriers , 1981, Networks.

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

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

[7]  Jirí Dokulil,et al.  Edge Routing with Fixed Node Positions , 2008, 2008 12th International Conference Information Visualisation.

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

[9]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[10]  Ioannis G. Tollis,et al.  Graph Drawing , 1994, Lecture Notes in Computer Science.

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

[12]  D. T. Lee,et al.  Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

[13]  Frank Leymann.  Web Services and Their Composition , 2001, EWSPT.

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

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

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

[17]  Ioannis G. Tollis,et al.  Interactive Orthogonal Graph Drawing , 1998, IEEE Trans. Computers.

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

[19]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

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

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

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

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

[24]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

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

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

[27]  Kim Marriott,et al.  Integrating Edge Routing into Force-Directed Layout , 2006, GD.

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

[29]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

[30]  Michael Forster,et al.  Crossings in clustered level graphs , 2005 .

[31]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[32]  Peter J. Stuckey,et al.  Removing Node Overlapping in Graph Layout Using Constrained Optimization , 2003, Constraints.

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

[34]  Kang Zhang,et al.  Node overlap removal in clustered directed acyclic graphs , 2009, J. Vis. Lang. Comput..

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

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