Upward planarization and layout

Drawing directed graphs has many applications and occurs whenever a natural flow of information is to be visualized. Given a directed acyclic graph (DAG) G, we are interested in an upward drawing of G, that is, a drawing of G in which all arcs are drawn as curves that are monotonically increasing in the vertical direction. Besides the upward property, it is desirable that the number of arc crossings arising in the drawing should be minimized. In this thesis, we propose a new approach for drawing DAGs based on the idea of upward planarization. We first introduce a novel upward planarization approach for upward crossing minimization of DAGs that utilizes new ideas for subgraph computation and arc reinsertion. In particular, it is the first upward crossing minimization algorithm which does not utilize any layering techniques known from the framework by Sugiyama et al. [STT81] or from the upward planarization algorithm by Eiglsperger et al. [EKE03]. Our approach addresses the main weakness of the classical two step upward crossing minimization approaches, where in the first step a layering of the input DAG is computed and then, in the second step, the number of crossings is minimized by solving the so-called k-level crossing minimization problem (k-LCM). However, choosing an inappropriate layering in the first step can negatively effect the subsequent k-level crossing minimization step, thus causing many unnecessary arc crossings. As shown by experimental evaluations, our new approach—referred to as layer-free upward crossing minimization (LFUP)—outperforms the state-ofthe-art crossing minimization heuristics based on layering even if an exact algorithm for k-level crossing minimization is used. Furthermore, LFUP also outperforms the existing approaches following the idea of upward planarization, that is, the approaches by Di Battista et al. [BPTT89] and Eiglsperger et al. [EKE03]. We also present two extensions for the new approach: an extension for upward planarization of directed hypergraphs and an extension for handling given port constraints, that is, drawing constraints that arise due to the prescribed positions where arcs can be connected to the drawing of the nodes. The upward planarization approach LFUP computes an upward planar representation (UPR) R of the input graph G, where crossings are modeled by dummy nodes. We introduce a new layout approach for realizing UPRs, that is, a drawing algorithm for constructing upward drawings where the arc crossings arising in the drawing are the ones modeled by the dummy nodes in R. Only few algorithms exist for realizing UPRs, most of these algorithms are based on simple ideas and originally developed for drawing planar st-graphs, hence our layout approach constitutes the first approach specialized for realizing UPRs. It offers two main advantages over the popular Sugiyama framework: It benefits from the advantage of the upward planarization approach LFUP, thus producing upward drawings with significantly less arc crossings. i Therefore, the drawing quality increases considerably. Furthermore, while the upward drawings produced by layer-based drawing approaches are often unstructured and appear unnaturally flat, the new layout approach constructs upward drawings that better reflect the structure of the digraphs and give a tidier impression to the viewer.

[1]  Petra Mutzel,et al.  An Experimental Study of Crossing Minimization Heuristics , 2003, Graph Drawing.

[2]  Patrick Healy,et al.  The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation , 1999, GD.

[3]  Roberto Tamassia,et al.  On the Computational Complexity of Upward and Rectilinear Planarity Testing , 1994, SIAM J. Comput..

[4]  Karsten Klein,et al.  An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract) , 2000, GD.

[5]  Olivier Goldschmidt,et al.  An efficient graph planarization two-phase heuristic , 1994, Networks.

[6]  Franz Rendl,et al.  Semidefinite relaxations of ordering problems , 2013, Math. Program..

[7]  Gerhard Reinelt,et al.  On the acyclic subgraph polytope , 1985, Math. Program..

[8]  R. Rudell Dynamic variable ordering for ordered binary decision diagrams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[9]  Markus Chimani,et al.  Algorithms for the Hypergraph and the Minor Crossing Number Problems , 2007, ISAAC.

[10]  Robert E. Tarjan,et al.  Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..

[11]  Michael Jünger,et al.  A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem , 1997, GD.

[12]  Georg Sander,et al.  Layout of Directed Hypergraphs with Orthogonal Hyperedges , 2003, GD.

[13]  Markus Chimani,et al.  Computing crossing numbers , 2009 .

[14]  Michael Jünger,et al.  Level Planarity Testing in Linear Time , 1998, Graph Drawing.

[15]  Jürgen Branke,et al.  Width-restricted layering of acyclic digraphs with consideration of dummy nodes , 2002, Inf. Process. Lett..

[16]  Markus Chimani,et al.  Layer-Free Upward Crossing Minimization , 2008, WEA.

[17]  Nikola S. Nikolov,et al.  How to Layer a Directed Acyclic Graph , 2001, GD.

[18]  MICHAEL D. HUTTON,et al.  Upward planar drawing of single source acyclic digraphs , 1991, SODA '91.

[19]  Bojan Mohar,et al.  The Minor Crossing Number , 2006, SIAM J. Discret. Math..

[20]  Shui Lam,et al.  Worst Case Analysis of Two Scheduling Algorithms , 1977, SIAM J. Comput..

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

[22]  Peter Eades A FAST EFFECTIVE HEURISTIC FOR THE FEEDBACK ARC SET PROBLEM , 1993 .

[23]  F. Brandenburg,et al.  Sorting Heuristics for the Feedback Arc Set Problem ? , 2011 .

[24]  Patrick Healy,et al.  The Vertex-Exchange Graph and its use in Multi-Level Graph Layout , 1999 .

[25]  Nikola S. Nikolov,et al.  A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem , 2002, Graph Drawing.

[26]  Nicolas Le Novère,et al.  Systems Biology Graphical Notation: Activity Flow language Level 1 , 2009 .

[27]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .

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

[29]  Thomas Ziegler,et al.  Crossing minimization in automatic graph drawing , 2000 .

[30]  Bernd Becker,et al.  Orthogonal Hypergraph Drawing for Improved Visibility , 2006, J. Graph Algorithms Appl..

[31]  Roberto Tamassia,et al.  A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..

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

[33]  Markus Chimani,et al.  Upward Planarization Layout , 2009, J. Graph Algorithms Appl..

[34]  Georg Sander,et al.  Graph Layout through the VCG Tool , 1994, GD.

[35]  Vance E. Waddle,et al.  An E log E Line Crossing Algorithm for Levelled Graphs , 1999, Graph Drawing.

[36]  Walter Didimo,et al.  Turn-regularity and optimal area drawings of orthogonal representations , 2000, Comput. Geom..

[37]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness , 1984, EATCS Monographs on Theoretical Computer Science.

[38]  Christian Bachmaier,et al.  A Global k-Level Crossing Reduction Algorithm , 2010, WALCOM.

[39]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

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

[41]  Georg Sander,et al.  Graph Layout for Applications in Compiler Construction , 1999, Theor. Comput. Sci..

[42]  Jürgen Branke,et al.  In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes , 2005, JEAL.

[43]  Giuseppe Liotta,et al.  Drawing Directed Acyclic Graphs: An Experimental Study , 2000, Int. J. Comput. Geom. Appl..

[44]  Peter J. Stuckey,et al.  Optimal k-Level Planarization and Crossing Minimization , 2010, GD.

[45]  Giuseppe Liotta,et al.  An Experimental Comparison of Four Graph Drawing Algorithms , 1997, Comput. Geom..

[46]  Emden R. Gansner,et al.  A Technique for Drawing Directed Graphs , 1993, IEEE Trans. Software Eng..

[47]  Xuemin Lin,et al.  How to draw a directed graph , 1989, [Proceedings] 1989 IEEE Workshop on Visual Languages.

[48]  Ronald L. Graham,et al.  Optimal scheduling for two-processor systems , 1972, Acta Informatica.

[49]  Michael Jünger,et al.  A Fast Layout Algorithm for k-Level Graphs , 2000, Graph Drawing.

[50]  G. Battista,et al.  Hierarchies and planarity theory , 1988, IEEE Trans. Syst. Man Cybern..

[51]  David Kelly Fundamentals of planar ordered sets , 1987, Discret. Math..

[52]  Michael Jünger,et al.  Journal of Graph Algorithms and Applications 2-layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms , 2022 .

[53]  Erkki Mäkinen Experiments on drawing 2-level hierarchical graphs , 1990, Int. J. Comput. Math..

[54]  K. P. Vo,et al.  DAG—a program that draws directed graphs , 1988, Softw. Pract. Exp..

[55]  Ioannis G. Tollis,et al.  Area requirement and symmetry display of planar upward drawings , 1992, Discret. Comput. Geom..

[56]  Petra Mutzel,et al.  An Alternative Method to Crossing Minimization on Hierarchical Graphs , 1996, GD.

[57]  Sarala M. Wimalaratne,et al.  The Systems Biology Graphical Notation , 2009, Nature Biotechnology.

[58]  Petra Mutzel,et al.  Port Constraints in Hierarchical Layout of Data Flow Diagrams , 2009, GD.

[59]  Michael Jünger,et al.  Simple and Efficient Bilayer Cross Counting , 2002, J. Graph Algorithms Appl..

[60]  Michael Jünger,et al.  Maximum planar subgraphs and nice embeddings: Practical layout tools , 1996, Algorithmica.

[61]  Georg Sander,et al.  A Fast Heuristic for Hierarchical Manhattan Layout , 1995, GD.

[62]  Christoph Buchheim,et al.  Exact Algorithms for the Quadratic Linear Ordering Problem , 2010, INFORMS J. Comput..

[63]  Lev Nachmanson,et al.  Graph Drawing Contest Report , 2009, Graph Drawing.

[64]  Carlo Batini,et al.  Computer aided layout of entity relationship diagrams , 1984, J. Syst. Softw..

[65]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[66]  R. Tamassia,et al.  Upward planarity testing , 1995 .

[67]  Helen C. Purchase,et al.  Which Aesthetic has the Greatest Effect on Human Understanding? , 1997, GD.

[68]  Roberto Tamassia,et al.  Algorithms for Plane Representations of Acyclic Digraphs , 1988, Theor. Comput. Sci..

[69]  Ulrik Brandes,et al.  Fast and Simple Horizontal Coordinate Assignment , 2001, GD.

[70]  Markus Chimani,et al.  Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints , 2010, Graph Drawing.

[71]  Ioannis G. Tollis,et al.  Automatic layout of PERT diagrams with X-PERT , 1989, [Proceedings] 1989 IEEE Workshop on Visual Languages.

[72]  Michael Jünger,et al.  An SDP approach to multi-level crossing minimization , 2012, JEAL.

[73]  Christian Bachmaier,et al.  Grid sifting: Leveling and crossing reduction , 2012, JEAL.

[74]  Nikola S. Nikolov,et al.  Graph layering by promotion of nodes , 2006, Discret. Appl. Math..

[75]  Paul Molitor,et al.  Using Sifting for k -Layer Straightline Crossing Minimization , 1999, GD.

[76]  Michael Forster,et al.  Gravisto: Graph Visualization Toolkit , 2004, GD.