A square time algorithm for cyclic edge connectivity of planar graphs.

zbMATH Open1488.05469MaRDI QIDQ3134375FDOQ3134375

Authors: Dingjun Lou 

Publication date: 9 February 2018

Recommendations

• Algorithm Theory - SWAT 2004
• An efficient algorithm for cyclic edge connectivity of regular graphs.
• An improved algorithm for cyclic edge connectivity of regular graphs.
• Computing the girth of a planar graph in \(O(n \log n)\) time
• Connectivity of planar graphs

zbMATH Keywords

planar graphcyclic edge connectivitysquare time algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Cited In (4)

• The \(k\)-subconnectedness of planar graphs
• A polynomial algorithm for cyclic edge connectivity of cubic graphs
• Enumeration of articulation pairs of a planar graph
• Constant Time Generation of Biconnected Rooted Plane Graphs

This page was built for publication: A square time algorithm for cyclic edge connectivity of planar graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3134375)