Abstract
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(n2 log2 n) for computing the cyclic edge connectivity of n-vertex cubic graphs. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
APA
Dvořák, Z., Kára, J., Král’, D., & Pangrác, O. (2004). An algorithm for cyclic edge connectivity of cubic graphs (extended abstract). Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3111, 236–247. https://doi.org/10.1007/978-3-540-27810-8_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free