Efficient algorithms for simplifying flow networks

DOI10.1007/11533719_75MaRDI QIDQ5716996zbMATH OpenOpenAlexFDO

Authors Ewa Misiołek, Danny Z. Chen

Publication date 11 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11533719

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Programming involving graphs or networks (90C35)

Recommendations

• Two flow network simplification algorithms
• Simplifying flow networks
• scientific article; zbMATH DE number 65738
• Max flows in O(nm) time, or better
• Algorithms for maximum network flow

Cited in

(6)

• Two flow network simplification algorithms
• Very Simple Methods for All Pairs Network Flow Analysis
• Algorithms for Placing Monitors in a Flow Network
• Simplifying maximum flow computations: the effect of shrinking and good initial flows
• Simplifying flow networks
• Distance-Preserving Graph Contractions

This page was built for publication: Efficient algorithms for simplifying flow networks

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