Publication details
An algorithm for cyclic edge connectivity of cubic graphs
| Authors | |
|---|---|
| Year of publication | 2004 |
| Type | Article in Periodical |
| Magazine / Source | ALGORITHM THEORY- SWAT 2004 |
| Citation | |
| Description | The cyclic edge connectivity is the size of a smallest edge cut in a graph such that at least two of the connected components contain cycles. We present an algorithm running in time O(n(2) log(2) n) for computing the cyclic edge connectivity of n-vertex cubic graphs. |