We introduce the technique of decomposing an undirected graph by finding a maximal set of edge-disjoint cycles. We give a parallel algorithm to find this decomposition in O(log n) time on (m+ n)/log n processors. We then use this decomposition to to give the first efficient parallel algorithm for finding an approximation to a minimum cycle cover.
