Algorithms for low-dimensional topology
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 475121 (Why is no real title available?)
- scientific article; zbMATH DE number 714558 (Why is no real title available?)
- Algorithms in low-dimensional topology: holonomic parametrization of knots
- An efficient algorithm to decide the knot problem
- Arkadenfadendarstellung von Knoten und eine neue Darstellung der Knotengruppe
- Ein Satz über Mittellinien
- Holonomic Links and Smale Principles for Multisingularities
- Holonomic and Legendrian parametrizations of knots
- The Kontsevich integral
Cited in
(9)- Algorithms in low-dimensional topology: holonomic parametrization of knots
- Computing invariants of knotted graphs given by sequences of points in 3-dimensional space
- Yarn ball knots and faster computations
- An algorithm for generating a family of alternating knots
- Efficient algorithms for computing a minimal homology basis
- Meander diagrams of knots and spatial graphs: proofs of generalized Jablan-Radović conjectures
- An efficient algorithm to decide the knot problem
- Implementation of the Topological $\varepsilon $-Algorithm
- Topological obstructions to blending algorithms
This page was built for publication: Algorithms for low-dimensional topology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q378696)