A string can be knotted up in complicated ways. A standard method of studying a knotted object is to break it up into simpler pieces and then analyze how the pieces fit back together. It is well known that a knotted circle can always be decomposed into two collections of untied arcs. This thesis provides an efficient way to compute the minimum number of untied segments needed by searching for special colorings of the knots.