Bottlenecks and Edge Connectivity in Unsymmetrical Networks
DOI10.1137/0208019zbMath0415.90037OpenAlexW2007557148MaRDI QIDQ3204982
Publication date: 1979
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0208019
computational complexityminimum cutdirected graphedge connectivityGomory-Hu algorithmmaximum flow matrixmultiterminal network flow
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items (6)
This page was built for publication: Bottlenecks and Edge Connectivity in Unsymmetrical Networks