Two flow network simplification algorithms

DOI10.1016/J.IPL.2005.11.002MaRDI QIDQ1045934zbMATH OpenOpenAlexFDO

Authors Ewa Misiołek, Danny Z. Chen

Publication date 18 December 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2005.11.002

zbMATH Keywords

flow networksgraph algorithmsmaximum flow

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Nonnumerical algorithms (68W05)

Recommendations

• Computing and Combinatorics
• scientific article; zbMATH DE number 1759406
• An O(n\log ^2 n) Algorithm for Maximum Flow in Undirected Planar Networks
• Flows in Undirected Unit Capacity Networks
• scientific article; zbMATH DE number 177817

Cites work

• A data structure for dynamic trees
• Dominators in Linear Time
• Fast Algorithms for Finding Nearest Common Ancestors
• scientific article; zbMATH DE number 42967 (Why is no real title available?)
• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• scientific article; zbMATH DE number 3270498 (Why is no real title available?)
• Introduction to algorithms
• Network flows. Theory, algorithms, and applications.
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• On the computational power of pushdown automata

Cited in

(12)

• On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
• On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees
• Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees
• Enumeration of BC-subtrees of trees
• Activity preserving graph simplification
• On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
• Very Simple Methods for All Pairs Network Flow Analysis
• scientific article; zbMATH DE number 1759406 (Why is no real title available?)
• Simple linear flow decomposition algorithms on trees, circles, and augmented trees
• Computing and Combinatorics
• On spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees
• Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs

This page was built for publication: Two flow network simplification algorithms

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