Graph Drawing and Network Visualization

Computer networks and distributed systems are typically represented as graphs, and sooner or later everybody working in distributed computing is facing a graph drawing problem. In my talk I will discuss a few artifacts in distributed computing that are related to graph theory and graph drawing. The focus of my talk will be wireless communication networks. While a vertex in a wireless network is simply some kind of communication device, vertices are not necessarily connected by edges, but rather “unplugged.” We discuss the following “family of open problems”: How well can we draw a wireless network modeled by a UDG, QUDG, BIG, or UBG, using connectivity, interference, distance, angle, or multipath information, to understand which node is which? Does such a drawing help to design better routing or media access protocols? The Role of Visual Analytics in Exploring Graph Data

[1]  Md. Saidur Rahman,et al.  Upward Planar Drawings of Series-Parallel Digraphs with Maximum Degree Three , 2007, WALCOM.

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

[3]  Martin Gronemann.  Algorithms for Incremental Planar Graph Drawing and Two-page Book Embeddings , 2015 .

[4]  David Harel,et al.  An Algorithm for Straight-Line Drawing of Planar Graphs , 1995, Algorithmica.

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

[6]  Colin Ware,et al.  Information Visualization: Perception for Design , 2000 .

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

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

[9]  E. Szemerédi.  Regular Partitions of Graphs , 1975 .

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

[11]  Colin Ware,et al.  Supporting Visual Queries on Medium-Sized Node–Link Diagrams , 2005, Inf. Vis..

[12]  Goos Kant,et al.  Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems , 1997, Theor. Comput. Sci..

[13]  Ulrik Brandes,et al.  A Labeling Problem for Symbol Maps of Archaeological Sites , 2016, GD 2016.

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

[15]  Jan Stola.  Unimaximal Sequences of Pairs in Rectangle Visibility Drawing , 2008, Graph Drawing.

[16]  Ioannis G. Tollis,et al.  Representations of Graphs on a Cylinder , 1991, SIAM J. Discret. Math..

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

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

[19]  Ryan A. Rossi,et al.  An Interactive Data Repository with Visual Analytics , 2016, SKDD.

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

[21]  Martin Gronemann,et al.  Bitonic st-orderings of Biconnected Planar Graphs , 2014, Graph Drawing.

[22]  Carsten Thomassen,et al.  Rectilinear drawings of graphs , 1988, J. Graph Theory.

[23]  Chris Walshaw,et al.  Journal of Graph Algorithms and Applications a Multilevel Algorithm for Force-directed Graph-drawing , 2022 .

[24]  Sue Whitesides,et al.  Rectangle Visibility Graphs: Characterization, Construction, and Compaction , 2003, STACS.

[25]  Arjan Kuijper,et al.  Visual Analysis of Large Graphs: State‐of‐the‐Art and Future Research Challenges , 2011, Eurographics.

[26]  Goos Kant,et al.  Area Requirement of Visibility Representations of Trees , 1997, Inf. Process. Lett..

[27]  Giuseppe Liotta,et al.  L-visibility drawings of IC-planar graphs , 2015, Inf. Process. Lett..

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

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

[30]  Naomi Nishimura,et al.  Embeddings of k-Connected Graphs of Pathwidth k , 2000, SWAT.

[31]  Ulrik Brandes,et al.  Interactive Level-of-Detail Rendering of Large Graphs , 2012, IEEE Transactions on Visualization and Computer Graphics.

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

[33]  Md. Saidur Rahman,et al.  Bar 1-Visibility Drawings of 1-Planar Graphs , 2013, ICAA.

[34]  Goos Kant,et al.  Drawing planar graphs using the canonical ordering , 1996, Algorithmica.

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

[36]  John T. Stasko,et al.  Toward a Deeper Understanding of the Role of Interaction in Information Visualization , 2007, IEEE Transactions on Visualization and Computer Graphics.

[37]  Thomas C. Shermer,et al.  On representations of some thickness-two graphs , 1995, Comput. Geom..

[38]  Achilleas Papakostas,et al.  Upward Planarity Testing of Outerplanar Dags ( Extended Abstract ) , 2005 .

[39]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[40]  Géza Tóth,et al.  Convex Sets in the Plane with Three of Every Four Meeting , 2001, Comb..