An algorithm for cyclic edge connectivity of cubic graphs

DVORAK, Z; J KARA; Daniel KRÁĽ and O PANGRAC. An algorithm for cyclic edge connectivity of cubic graphs. ALGORITHM THEORY- SWAT 2004. BERLIN: SPRINGER-VERLAG BERLIN, 2004, vol. 3111, p. 236-247. ISSN 0302-9743.

Basic information

Original name

An algorithm for cyclic edge connectivity of cubic graphs

Authors

DVORAK, Z; J KARA; Daniel KRÁĽ and O PANGRAC

Edition

ALGORITHM THEORY- SWAT 2004, BERLIN, SPRINGER-VERLAG BERLIN, 2004, 0302-9743

---

Other information

Language

English

Type of outcome

Article in a journal

Confidentiality degree

is not subject to a state or trade secret

UT WoS

000222682500021

---

Abstract

In the original language

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.