Finding the edge connectivity of directed graphs

DOI10.1016/0196-6774(89)90024-2zbMath0664.05040OpenAlexW2009267898MaRDI QIDQ3815335

Baruch Schieber, Yishay Mansour

Publication date: 1989

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(89)90024-2

zbMATH Keywords

algorithmsdirected graphedge connectivity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (2)

Construction for bicritical graphs and \(k\)-extendable bipartite graphs ⋮ Extracting maximal information about sets of minimum cuts

This page was built for publication: Finding the edge connectivity of directed graphs