Drawing graphs using modular decomposition

In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our algorithm works by traversing the modular decomposition tree of the input graph G on n vertices and m edges, in a bottom-up fashion until it reaches the root of the tree, while at the same time intermediate drawings are computed. In order to achieve aesthetically pleasing results, we use grid and circular placement techniques, and utilize an appropriate modification of a well-known spring embedder algorithm. It turns out, that for some classes of graphs, our algorithm runs in O(n+m) time, while in general, the running time is bounded in terms of the processing time of the spring embedder algorithm. The result is a drawing that reveals the structure of the graph G and preserves certain aesthetic criteria.

[1]  Carolyn McCreary,et al.  Clan-Based Incremental Drawing , 2000, Graph Drawing.

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

[3]  Carolyn McCreary,et al.  Directed Graphs by Clan-Based Decomposition , 1995, GD.

[4]  Jens Gustedt,et al.  Efficient and Practical Algorithms for Sequential Modular Decomposition , 2001, J. Algorithms.

[5]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[6]  Hiroshi Nagamochi,et al.  Drawing Clustered Graphs on an Orthogonal Grid , 1999, J. Graph Algorithms Appl..

[7]  Xiaobo Wang,et al.  Generating Customized Layouts , 1995, Graph Drawing.

[8]  Andrzej Ehrenfeucht,et al.  An O(n²) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs , 1994, J. Algorithms.

[9]  U. Brandes,et al.  GraphML Progress Report ? Structural Layer Proposal , 2001 .

[10]  T. Gallai.  Transitiv orientierbare Graphen , 1967 .

[11]  Robert F. Cohen,et al.  Planarity for Clustered Graphs , 1995, ESA.

[12]  Irene Finocchi,et al.  Hierarchical Decompositions for Visualizing Large Graphs , 2002 .

[13]  Udi Rotics,et al.  Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition , 2002, SWAT.

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

[15]  Julien Gagneur,et al.  Modular decomposition of protein-protein interaction networks , 2004, Genome Biology.

[16]  David Harel,et al.  Drawing graphs with non-uniform vertices , 2002, AVI '02.

[17]  Bruno R. Preiss,et al.  Data Structures and Algorithms with Object-Oriented Design Patterns in Java , 1999 .

[18]  Ioannis G. Tollis,et al.  A Framework for User-Grouped Circular Drawings , 2003, GD.

[19]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[20]  Elias Dahlhaus,et al.  Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition , 2000, J. Algorithms.

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

[22]  Peter Eades,et al.  A Fully Animated Interactive System for Clustering and Navigating Huge Graphs , 1998, GD.

[23]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.

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

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

[26]  Daniel Tunkelang,et al.  A Numerical Optimization Approach to General Graph Drawing , 1999 .

[27]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[28]  Franz-Josef Brandenburg,et al.  Graph Clustering 1: Circles of Cliques , 1997, GD.

[29]  Toshimitsu Masuzawa,et al.  A layout adjustment problem for disjoint rectangles preserving orthogonal order , 1998, Systems and Computers in Japan.

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

[31]  Carlo Mannino,et al.  Optimal Upward Planarity Testing of Single-Source Digraphs , 1993, ESA.

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

[33]  Jeremy P. Spinrad,et al.  Incremental modular decomposition , 1989, JACM.

[34]  Xuemin Lin,et al.  Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs , 1996, Graph Drawing.

[35]  Jeremy P. Spinrad,et al.  Modular decomposition and transitive orientation , 1999, Discret. Math..

[36]  Tao Lin,et al.  Integration of Declarative and Algorithmic Approaches for Layout Creation , 1994, Graph Drawing.

[37]  Franz-Josef Brandenburg,et al.  Designing Graph Drawings by Layout Graph Grammars , 1994, GD.

[38]  Ross M. McConnell,et al.  Linear-time modular decomposition of directed graphs , 2005, Discret. Appl. Math..