Computing height-optimal tangles faster

DOI10.1007/978-3-030-35802-0_16OpenAlexW2990708705MaRDI QIDQ2206851

Johannes Zink, Oksana Firman, Philipp Kindermann, Alexander Wolff, O. V. Ravskyj

Publication date: 26 October 2020

Full work available at URL: https://arxiv.org/abs/1901.06548

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

The complexity of finding tangles

Cites Work

• Unnamed Item
• Visualizing the template of a chaotic attractor
• Knotted periodic orbits in dynamical systems. I: Lorenz's equations
• Representing Permutations with Few Moves
• Drawing Permutations with Few Corners
• Classification of strange attractors by integers

This page was built for publication: Computing height-optimal tangles faster