Routing flow through a strongly connected graph

DOI10.1007/S00453-001-0082-YzbMATH Open1009.68185OpenAlexW60910956MaRDI QIDQ1348945FDOQ1348945

Authors Thomas Erlebach, Torben Hagerup 

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

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

Recommendations

• Finding a feasible flow in a strongly connected network
• scientific article; zbMATH DE number 177817
• scientific article; zbMATH DE number 4204092
• An $o(n^3 )$-Time Maximum-Flow Algorithm
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm

Cited in

(2)

• Routing on the Visibility Graph
• Finding a feasible flow in a strongly connected network

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348945)