Computing invariants of knotted graphs given by sequences of points in 3-dimensional space

DOI10.1007/978-3-319-44684-4_21MaRDI QIDQ5359525zbMATH OpenOpenAlexFDO

Authors Vitaliy Kurlin

Publication date 25 September 2017

Published in Mathematics and Visualization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-44684-4_21

zbMATH Keywords

complementfundamental grouppolygonal graphprotein

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Computing fundamental groups from point clouds
• Algorithms for low-dimensional topology
• An algorithm for detecting intrinsically knotted graphs
• Recognition algorithms in knot theory
• The computational complexity of knot and link problems

Cited in

(1)

• Detecting unknotted graphs in 3-space

This page was built for publication: Computing invariants of knotted graphs given by sequences of points in 3-dimensional space

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