We present a practical polynomial-time algorithm for computing cyclic edge-connectivity of cubic graphs.
