AN EASY AND FAST ALGORITHM FOR OBTAINING MINIMAL DISCRETE KNOTS
From MaRDI portal
Publication:5483329
DOI10.1142/S021821650600466XzbMath1099.57005OpenAlexW2092236052MaRDI QIDQ5483329
Publication date: 14 August 2006
Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s021821650600466x
Cites Work
- Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
- A new algorithm for recognizing the unknot
- Virtual knot theory
- The number of smallest knots on the cubic lattice
- MINIMAL KNOTTED POLYGONS ON THE CUBIC LATTICE
- DISCRETE KNOTS
- TOWARDS AN IMPLEMENTATION OF THE B–H ALGORITHM FOR RECOGNIZING THE UNKNOT
- A METHOD FOR COMPUTING FAMILIES OF DISCRETE KNOTS USING KNOT NUMBERS