Generalized Layerings for Arbitrary and Fixed Drawing Areas

The Directed Layering Problem (DLP) solves a step of the widely used layer-based approach to automatically draw directed acyclic graphs. To cater for cyclic graphs, usually a preprocessing step is used that solves the Feedback Arc Set Problem (FASP) to make the graph acyclic before a layering is determined. Here we present the Generalized Layering Problem (GLP), which solves the combination of DLP and FASP simultaneously, allowing general graphs as input. We present an integer programming model and a heuristic to solve the NP-complete GLP and perform thorough evaluations on different sets of graphs and with different implementations for the steps of the layer-based approach. We observe that GLP reduces the number of dummy nodes significantly, can produce more compact drawings, and improves on graphs where DLP yields poor aspect ratios. The drawings resulting from GLP also turn out to be more suitable for making the best possible use of a given drawing area. However, we show that a specialized variant of GLP can yield considerable improvements w. r. t. this particular optimization goal.

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

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

[3]  Kim Marriott,et al.  HOLA: Human-like Orthogonal Network Layout , 2016, IEEE Transactions on Visualization and Computer Graphics.

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

[5]  Bonnie Berger,et al.  Approximation alogorithms for the maximum acyclic subgraph problem , 1990, SODA '90.

[6]  Joseph Naor,et al.  Approximating Minimum Feedback Sets and Multicuts in Directed Graphs , 1998, Algorithmica.

[7]  Liviu Iftode,et al.  Finding hierarchy in directed online social networks , 2011, WWW.

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

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

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

[11]  Anders Yeo,et al.  The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments , 2006, Combinatorics, Probability and Computing.

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

[13]  Bongshin Lee,et al.  Drawing Graphs with GLEE , 2007, Graph Drawing.

[14]  Petra Mutzel,et al.  Examining the Compactness of Automatic Layout Algorithms for Practical Diagrams , 2014 .

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

[16]  Adrian Rusu,et al.  Tree Drawing Algorithms , 2013, Handbook of Graph Drawing and Visualization.

[17]  Y. Koren,et al.  Dig-CoLa: directed graph layout through constrained energy minimization , 2005, IEEE Symposium on Information Visualization, 2005. INFOVIS 2005..

[18]  Michael Hecht,et al.  Exact Localisations of Feedback Sets , 2017, Theory of Computing Systems.

[19]  Miro Spönemann,et al.  Graph Layout Support for Model-Driven Engineering , 2015 .

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

[21]  Jürgen Branke,et al.  Dynamic Graph Drawing , 2001, Drawing Graphs.

[22]  Juan José Pantrigo,et al.  Scatter search for the cutwidth minimization problem , 2012, Ann. Oper. Res..

[23]  Reinhard von Hanxleden,et al.  A Generalization of the Directed Graph Layering Problem , 2016, GD.

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

[25]  Camil Demetrescu,et al.  Combinatorial algorithms for feedback problems in directed graphs , 2003, Inf. Process. Lett..

[26]  Xuemin Lin,et al.  A Fast and Effective Heuristic for the Feedback Arc Set Problem , 1993, Inf. Process. Lett..

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

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

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

[30]  Petra Mutzel,et al.  Compact Layered Drawings of General Directed Graphs , 2016, Graph Drawing.

[31]  Nikola S. Nikolov,et al.  Hierarchical Drawing Algorithms , 2013, Handbook of Graph Drawing and Visualization.

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