A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width

06/18/2018
by   Michael Jünger, et al.
0

We consider the coordinate assignment phase of the well known Sugiyama framework for drawing directed graphs in a hierarchical style. The extensive literature in this area has given comparatively little attention to a prescribed width of the drawing. We present a minimum cost flow formulation that supports prescribed width and optionally other criteria like lower and upper bounds on the distance of neighbouring nodes in a layer or enforced vertical edges segments. In our experiments we demonstrate that our approach can compete with state-of-the-art algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/24/2020

Algorithms and Experiments Comparing Two Hierarchical Drawing Frameworks

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

A Natural Quadratic Approach to the Generalized Graph Layering Problem

We propose a new exact approach to the generalized graph layering proble...
research
12/20/2019

Improved Upper and Lower Bounds for LR Drawings of Binary Trees

In SODA'99, Chan introduced a simple type of planar straight-line upward...
research
06/30/2023

Logarithmic Weisfeiler–Leman Identifies All Graphs of Bounded Rank Width

In this paper, we extend the work of Grohe Neuen (ACM T. Comput. Log...
research
12/17/2018

Comparing Linear Width Parameters for Directed Graphs

In this paper we introduce the linear clique-width, linear NLC-width, ne...
research
06/12/2018

Computing directed path-width and directed tree-width of recursively defined digraphs

In this paper we consider the directed path-width and directed tree-widt...
research
08/04/2020

Erratum: Fast and Simple Horizontal Coordinate Assignment

We point out two flaws in the algorithm of Brandes and Köpf (Proc. GD 20...

Please sign up or login with your details

Forgot password? Click here to reset