Highly Influential

10 Excerpts

- Published 2010

This paper generalizes the results of Sadjadi [4] and Alley [1] by providing an algorithm to find a lower bound on the ropelength of any knot which admits a reduced diagram. This lower bound is found by changing this problem of geometry into one of linear programming, which is then solved by the simplex algorithm.

@inproceedings{McGuigan2010LowerBF,
title={Lower Bounds for the Ropelength of Reduced Conformations},
author={Robert McGuigan},
year={2010}
}