Generalization of the Ford-Fulkerson theorem to multigraphs

MaRDI QIDQ2563400zbMATH OpenFDO

Authors Inna A. Mikhailova

Publication date 11 December 1996

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

maximal flowmultigraphnetwork

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Review text

A multigraph with one source and one sink is considered. Then the Ford-Fulkerson theorem is extended to the multigraph case. This theorem allows us to consider a multigraph as a graph with different flow capacity of the arcs.

Recommendations

• On the relation of max-flow to min-cut for generalized networks
• scientific article; zbMATH DE number 3982882
• Combinatorial approaches to multiflow problems
• On Gale's feasibility theorem for certain infinite networks

Cited in

(2)

• Fine-Wilf graphs and the generalized Fine-Wilf theorem
• scientific article; zbMATH DE number 5941304 (Why is no real title available?)

This page was built for publication: Generalization of the Ford-Fulkerson theorem to multigraphs

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