no code implementations • 11 Mar 2021 • Jonathan Klawitter, Johannes Zink
On the positive side, we can decide whether a given cactus graph admits an upward planar $k$-slope drawing and, in the affirmative, construct such a drawing in FPT time with parameter $k$.
Computational Geometry
1 code implementation • 19 Jan 2019 • Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink
We show that this problem is NP-hard, and we give an algorithm that computes an optimal tangle for $n$ wires and a given list $L$ of swaps in $O((2|L|/n^2+1)^{n^2/2} \cdot \varphi^n \cdot n)$ time, where $\varphi \approx 1. 618$ is the golden ratio.
Discrete Mathematics
1 code implementation • 26 Jun 2018 • Steven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink
Finally, we make two known algorithms embedding-preserving; for drawing 1-planar RAC graphs with at most one bend per edge and for drawing IC-planar RAC graphs straight-line.
Computational Geometry Discrete Mathematics
