No label defined (Q4540087)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1769331
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1769331 |
Statements
21 July 2002
0 references
matching problems
0 references
network flows
0 references
balanced flow networks
0 references
augmenting path
0 references
0.8933688998222351
0 references
0.8922112584114075
0 references
0.8888647556304932
0 references
0.8390000462532043
0 references
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.
0 references