C. Martel, D. Naor and D. Gusfield, "A fast algorithm for optimally increasing the edge-connectivity," Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science(FOCS), St. Louis, MO, USA, 1990, pp. 698-707 vol.2.
doi:10.1109/FSCS.1990.89592
keywords:{time bound; undirected unweighted graph; time complexity; edge-connectivity; input parameter; edge augmentation problem; optimal augmentation},
url:doi.ieeecomputersociety.org/10.1109/FSCS.1990.89592