Algorithms and Bounds for Drawing Directed Graphs

08/30/2018
by   Giacomo Ortali, et al.
0

In this paper we present a new approach to visualize directed graphs and their hierarchies that completely departs from the classical four-phase framework of Sugiyama and computes readable hierarchical visualizations that contain the complete reachability information of a graph. Additionally, our approach has the advantage that only the necessary edges are drawn in the drawing, thus reducing the visual complexity of the resulting drawing. Furthermore, most problems involved in our framework require only polynomial time. Our framework offers a suite of solutions depending upon the requirements, and it consists of only two steps: (a) the cycle removal step (if the graph contains cycles) and (b) the channel decomposition and hierarchical drawing step. Our framework does not introduce any dummy vertices and it keeps the vertices of a channel vertically aligned. The time complexity of the main drawing algorithms of our framework is O(kn), where k is the number of channels, typically much smaller than n (the number of vertices).

READ FULL TEXT
research
07/26/2019

Adventures in Abstraction: Reachability in Hierarchical Drawings

We present algorithms and experiments for the visualization of directed ...
research
08/27/2021

One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons

We consider the problem of drawing an outerplanar graph with n vertices ...
research
08/06/2021

CFGConf: Supporting high level requirements for visualizing Control Flow Graphs

Control Flow Graphs (CFGs) are directed graphs that represent all possib...
research
11/24/2020

Algorithms and Experiments Comparing Two Hierarchical Drawing Frameworks

We present algorithms that extend the path-based hierarchical drawing fr...
research
03/22/2016

Graphs Drawing through Fuzzy Clustering

Many problems can be presented in an abstract form through a wide range ...
research
09/09/2022

Experiments and a User Study for Hierarchical Drawings of Graphs

We present experimental results and a user study for hierarchical drawin...
research
08/31/2017

Drawing bobbin lace graphs, or, Fundamental cycles for a subclass of periodic graphs

In this paper, we study a class of graph drawings that arise from bobbin...

Please sign up or login with your details

Forgot password? Click here to reset