An Improved Algorithm for Cyclic Edge Connectivity of Regular Graphs

Abstract

In this paper, we develop an \(O(k^9 V^6)\) time algorithm to determine the cyclic edge connectivity of \(k\)-regular graphs of order \(V\) for \(k \geq 3\), which improves upon a previously known algorithm by Lou and Wang.