TY - CONF
TI - A fast algorithm for optimally increasing the edge-connectivity
T2 - Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science(FOCS)
SP - 698
EP - 707 vol.2
AU - C. Martel
AU - D. Naor
AU - D. Gusfield
PY - 1990
KW - time bound
KW - undirected unweighted graph
KW - time complexity
KW - edge-connectivity
KW - input parameter
KW - edge augmentation problem
KW - optimal augmentation
DO - 10.1109/FSCS.1990.89592
JO - Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science(FOCS)
SN - 0-8186-2082-X
VO - 10.1109/FSCS.1990.89592
VL - 00
JA - Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science(FOCS)
Y1 - October 1990
ER -