scientific article; zbMATH DE number 1769331

DOI10.1002/(SICI)1097-0037(199901)33:1%3C29::AID-NET2%3E3.0.CO;2-UMaRDI QIDQ4540087zbMATH OpenFDO

Authors Christian Fremuth-Paeger, Dieter Jungnickel

Publication date 21 July 2002

Full work available at URL https://doi.org/10.1002/(SICI)1097-0037(199901)33:1%3C29::AID-NET2%3E3.0.CO;2-U

zbMATH Keywords

augmenting pathbalanced flow networksmatching problemsnetwork flows

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Deterministic network models in operations research (90B10)

Recommendations

• Balanced network flows. III. Strongly polynomial augmentation algorithms
• Balancing Applied to Maximum Network Flow Problems
• 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
• scientific article; zbMATH DE number 1769330
• A POLYNOMIAL-TIME BINARY SEARCH ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM

Cites work

• Balanced network flows. IV: Duality and structure theory.
• scientific article; zbMATH DE number 3936534 (Why is no real title available?)

Cited in

(5)

• Balanced network flows. IV: Duality and structure theory.
• Balanced network flows. VI: Polyhedral descriptions.
• Balanced network flows. III. Strongly polynomial augmentation algorithms
• scientific article; zbMATH DE number 1867228 (Why is no real title available?)
• Graph factors and factorization: 1985--2003: a survey

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 Q4540087)