A Square Time Algorithm for Cyclic Edge Connectivity of Planar Graphs

Abstract

In this paper, we introduce an $O(n^2)$ time algorithm to determine the cyclic edge connectivity of a planar graph, where $n$ is the order of the planar graph. This is the first correct square time algorithm for cyclic edge connectivity of planar graphs.