Routing flow through a strongly connected graph

DOI10.1007/S00453-001-0082-YzbMath1009.68185OpenAlexW60910956MaRDI QIDQ1348945

Torben Hagerup, Erlebach, Thomas

Publication date: 21 May 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0082-y

zbMATH Keywords

binary blocking flow algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Finding a feasible flow in a strongly connected network

This page was built for publication: Routing flow through a strongly connected graph