An Improved Algorithm for Cyclic Edge Connectivity of Regular Graphs

摘要

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 >= 3 which is an improvement of a known algorithm by Lou and Wang.