Adventures in Abstraction: Reachability in Hierarchical Drawings

07/26/2019
by   Panagiotis Lionakis, et al.
0

We present algorithms and experiments for the visualization of directed graphs that focus on displaying their reachability information. Our algorithms are based on the concepts of the path and channel decomposition as proposed in the framework presented in GD 2018 (pp. 579-592) and focus on showing the existence of paths clearly. In this paper we customize these concepts and present experimental results that clearly show the interplay between bends, crossings and clarity. Additionally, our algorithms have direct applications to the important problem of showing and storing transitivity information of very large graphs and databases. Only a subset of the edges is drawn, thus reducing the visual complexity of the resulting drawing, and the memory requirements for storing the transitivity information. Our algorithms require almost linear time, O(kn+m), where k is the number of paths/channels, n and m is the number of vertices and edges, respectively. They produce progressively more abstract drawings of the input graph. No dummy vertices are introduced and the vertices of each path/channel are vertically aligned.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/30/2018

Algorithms and Bounds for Drawing Directed Graphs

In this paper we present a new approach to visualize directed graphs and...
research
02/15/2019

Massively Parallel Path Space Filtering

Restricting path tracing to a small number of paths per pixel for perfor...
research
11/24/2020

Algorithms and Experiments Comparing Two Hierarchical Drawing Frameworks

We present algorithms that extend the path-based hierarchical drawing fr...
research
12/07/2022

Fast and Practical DAG Decomposition with Reachability Applications

We present practical linear and almost linear-time algorithms to compute...
research
10/16/2020

Restless reachability problems in temporal graphs

We study a family of reachability problems under waiting-time restrictio...
research
02/08/2021

A Dynamic Data Structure for Temporal Reachability with Unsorted Contact Insertions

Temporal graphs represent interactions between entities over the time. T...
research
06/15/2023

Graph Extraction for Assisting Crash Simulation Data Analysis

In this work, we establish a method for abstracting information from Com...

Please sign up or login with your details

Forgot password? Click here to reset