Three commodity flows in graphs

DOI10.3792/PJAA.59.266zbMath0525.05044OpenAlexW2026530148MaRDI QIDQ594107

Haruko Okamura

Publication date: 1983

Published in: Proceedings of the Japan Academy. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3792/pjaa.59.266

zbMATH Keywords

multicommodity flowthree commodity flow problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Connectivity (05C40)

Related Items (1)

Paths and edge-connectivity in graphs

Cites Work

• A short proof of the two-commodity flow theorem
• Disjoint paths in graphs
• 2-linked graphs
• Multicommodity flows in planar graphs
• Multicommodity flows in graphs
• Maximal Flow Through a Network
• Four-terminus flows
• On Odd Cuts and Plane Multicommodity Flows
• Multi-Commodity Network Flows

This page was built for publication: Three commodity flows in graphs