The problem of enumerating all proper cuts of a linear graph arises in several reliability applications and is usually solved by algebraic algorithms. We present a new algorithm based upon implicit enumeration. In addition, we present comparative computational experience which shows that the new algorithm requires significantly less computer time than existing algorithms.