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

MaRDI QIDQ3134375zbMATH OpenFDO

Authors Dingjun Lou

Publication date 9 February 2018

zbMATH Keywords

cyclic edge connectivityplanar graphsquare time algorithm

Mathematics Subject Classification ID

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

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 n) time
• Connectivity of planar graphs

Cited in

(4)

• Enumeration of articulation pairs of a planar graph
• The \(k\)-subconnectedness of planar graphs
• A polynomial algorithm for cyclic edge connectivity of cubic graphs
• 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)