Simplifying flow networks

DOI10.1007/3-540-44612-5_15MaRDI QIDQ4536355zbMATH OpenFDO

Authors Broňa Brejová, Tomáš Vinař, Therese Biedl

Publication date 8 October 2002

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

Full work available at URL https://doi.org/10.1007/3-540-44612-5_15

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)

Recommendations

• Computing and Combinatorics
• Two flow network simplification algorithms
• scientific article; zbMATH DE number 988194
• Simplifying maximum flow computations: the effect of shrinking and good initial flows
• Algorithms for maximum network flow

Cited in

(11)

• Two flow network simplification algorithms
• Removing undesirable flows by edge deletion
• Activity preserving graph simplification
• On the computational complexity of combinatorial flexibility problems
• Very Simple Methods for All Pairs Network Flow Analysis
• Combinatorial flexibility problems and their computational complexity
• Simplifying maximum flow computations: the effect of shrinking and good initial flows
• Distance-Preserving Graph Contractions
• Simplification of signal flow graphs
• Computing and Combinatorics
• Distance-preserving graph compression techniques

This page was built for publication: Simplifying flow networks

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