Abstract
We present an algorithm that untangles the cycle graph C_n while keeping at least cn^{2/3} vertices fixed. For any graph G, we also prove an upper bound for the number of fixed vertices for the worst initial drawing.
The bound is a function of the number of vertices, maximum degree and diameter of G