Conference
Aug 2026
Connectivity Augmentation of Plane Graphs
An algorithm is given that computes a minimum set of edges that makes a connected plane graph 2-edge-connected in \(O(|V|(1+\alpha(|V|)))\) time and linear space, where \(\alpha\) is the inverse Ackermann function.
K. Dehaleesan, Asif Khan, Pranabendu Misra
· International Symposium on M... · 0 citations