scientific article; zbMATH DE number 1759406

zbMATH Open0996.90014MaRDI QIDQ4536355FDOQ4536355

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

Publication date: 8 October 2002

Title of this publication is not available (Why is that?)

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

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)

Cited In (11)

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

This page was built for publication:

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