Erratum: Fast and Simple Horizontal Coordinate Assignment

08/04/2020
by   Ulrik Brandes, et al.
0

We point out two flaws in the algorithm of Brandes and Köpf (Proc. GD 2001), which is often used for the horizontal coordinate assignment in Sugiyama's framework for layered layouts. One of them has been noted and fixed multiple times, the other has not been documented before and requires a non-trivial adaptation. On the bright side, neither running time nor extensions of the algorithm are affected adversely.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/11/2022

Optimizing a low-dimensional convex function over a high-dimensional cube

For a matrix W ∈ℤ^m × n, m ≤ n, and a convex function g: ℝ^m →ℝ, we are ...
research
10/07/2021

Faster algorithm for Unique (k,2)-CSP

In a (k,2)-Constraint Satisfaction Problem we are given a set of arbitra...
research
02/04/2000

On the accuracy and running time of GSAT

Randomized algorithms for deciding satisfiability were shown to be effec...
research
09/09/2022

Trigger Warnings: Bootstrapping a Violence Detector for FanFiction

We present the first dataset and evaluation results on a newly defined c...
research
08/12/2021

CNF Satisfiability in a Subspace and Related Problems

We introduce the problem of finding a satisfying assignment to a CNF for...
research
01/28/2020

A Class of Linear Programs Solvable by Coordinate-wise Minimization

Coordinate-wise minimization is a simple popular method for large-scale ...
research
06/18/2018

A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width

We consider the coordinate assignment phase of the well known Sugiyama f...

Please sign up or login with your details

Forgot password? Click here to reset