Minimizing the height of simple tangles

DOI10.7155/JGAA.V30I1.3220MaRDI QIDQ7357268zbMATH OpenFDO

Authors Ignaz Rutter

Publication date 25 September 2026

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/JGAA.V30I1.3220

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cites work

• A function for evaluating the computing time of a bubbling system
• Classification of strange attractors by integers
• Computing height-optimal tangles faster
• Deciding the feasibility and minimizing the height of tangles
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 2176112 (Why is no real title available?)
• Knotted periodic orbits in dynamical systems. I: Lorenz's equations
• The complexity of finding tangles
• Visualizing the template of a chaotic attractor

This page was built for publication: Minimizing the height of simple tangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7357268)