scientific article; zbMATH DE number 1769331
Based on the theory developed in the first paper of the series [ibid. 33, 1-28 (1999; Zbl 0999.90005)] this paper presents some explicit augmentation procedures. The algorithms are given in object oriented pseudocode, and general set, network, balanced network, and balanced flow network objects are shown first. Pseudocode for a path expansion procedure and data structures fo management of shrinking families are given. Then two different balanced network search algorithms are presented and analysed. A breadth-first algorithm is shown, which improves the algorithm by \textit{W. Kocay} and \textit{D. Stone} [J. Comb. Math. Comb. Comput. 19, 3-31 (1995; Zbl 0841.68098)]. The second algorithm is a breadth first algorithm which is based on \textit{T. Kameda} and \textit{I. Munro}'s cardinality matching algorithm [Computing 12, 91-98 (1974; Zbl 0278.65069)]. For Part III, see ibid. 33, 43-56 (1999; Zbl 0999.90007) below.
- 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(n2/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
- 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)