DocumentCode
2872864
Title
An Efficient Algorithm for Cyclic Edge Connectivity of Planar Graphs
Author
Lu, Yunting ; Lu, Xin
Author_Institution
Shenzhen Inst. of Inf. Technol., Shenzhen, China
Volume
2
fYear
2009
fDate
18-19 July 2009
Firstpage
193
Lastpage
195
Abstract
A cyclic edge cutset is an edge cutset whose deletion disconnects the graph such that two of the components contain a cycle respectively. The cyclic edge connectivity clambda(G) is the minimum cardinality of all the cyclic edge cutsets of G. There is no polynomial time algorithm to determine the cyclic edge connectivity of a graph. In this paper,we develop a polynomial time algorithm to determine the cyclic edge connectivity of a planar graph. The time complexity of the algorithm is bounded by O(|V|2).
Keywords
computational complexity; graph theory; cyclic edge connectivity; cyclic edge cutset; planar graph; polynomial time algorithm; time complexity; Application software; Computer architecture; Computer networks; Information processing; Information technology; Polynomials; Proteins; Robust stability; Terminology; algorithm; cyclic edge connectivity; planar;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Processing, 2009. APCIP 2009. Asia-Pacific Conference on
Conference_Location
Shenzhen
Print_ISBN
978-0-7695-3699-6
Type
conf
DOI
10.1109/APCIP.2009.184
Filename
5197169
Link To Document