A new algorithm to determine minimally k-edgeconnected graphs with odd k

DOI10.12785/AMIS/070316zbMath1264.05135OpenAlexW2325956784MaRDI QIDQ4925419

Yunming Ye, Yueping Li

Publication date: 12 June 2013

Published in: Applied Mathematics & Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.12785/amis/070316

zbMATH Keywords

time complexityedge connectivitydivide-and-conquer algorithmminimally edge-connected

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

This page was built for publication: A new algorithm to determine minimally k-edgeconnected graphs with odd k