scientific article; zbMATH DE number 842873

MaRDI QIDQ4862333zbMATH OpenFDO

Authors Doug Stone, William Kocay

Publication date 2 July 1996

zbMATH Keywords

network flowsmaximum matchingsfactor problembalanced network searchmaximum capacitated \(b\)-matchings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 1769330
• TWO EFFICIENT ALGORITHMS FOR THE GENERALIZED MAXIMUM BALANCED FLOW PROBLEM
• scientific article; zbMATH DE number 653269
• A POLYNOMIAL-TIME BINARY SEARCH ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM
• Balanced network flows. III. Strongly polynomial augmentation algorithms

Cited in

(6)

• Balanced network flows. III. Strongly polynomial augmentation algorithms
• scientific article; zbMATH DE number 1769330 (Why is no real title available?)
• scientific article; zbMATH DE number 2209804 (Why is no real title available?)
• scientific article; zbMATH DE number 653269 (Why is no real title available?)
• Balanced network flows. V: Cycle-canceling algorithms.
• Balanced network flows. VI: Polyhedral descriptions.

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