Edge-disjoint branching in directed multigraphs
From MaRDI portal
Publication:1255784
DOI10.1016/0020-0190(79)90086-3zbMath0402.68051MaRDI QIDQ1255784
Publication date: 1979
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(79)90086-3
68R10: Graph theory (including graph drawing) in computer science
68W99: Algorithms in computer science
Related Items
A parallel algorithm for approximating the minimum cycle cover, Some generalizations of Menger's theorem concerning arc-connected digraphs