Balanced network flows. V: Cycle-canceling algorithms.

DOI10.1002/NET.1014MaRDI QIDQ2744654zbMATH OpenOpenAlexFDO

Authors Christian Fremuth-Paeger, Dieter Jungnickel

Publication date 31 July 2002

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.1014

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1769330
• Balanced network flows. III. Strongly polynomial augmentation algorithms
• scientific article; zbMATH DE number 1867228
• scientific article; zbMATH DE number 653269
• scientific article; zbMATH DE number 842873

Cited in

(6)

• Balanced network flows. IV: Duality and structure theory.
• Balanced network flows. VI: Polyhedral descriptions.
• Balanced network flows. VII: Primal-dual algorithms.
• scientific article; zbMATH DE number 1769330 (Why is no real title available?)
• scientific article; zbMATH DE number 1867228 (Why is no real title available?)
• Balanced network flows. VIII. A revised theory of phase‐ordered algorithms and the O( $\bf\it\sqrt{n}m$ log(n²/m)/log n) bound for the nonbipartite cardinality matching problem

This page was built for publication: Balanced network flows. V: Cycle-canceling algorithms.

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