MINIMUM FLOW VARIATION IN MAXIMUM FLOWS

DOI10.1142/S1793830910000735zbMath1201.05043MaRDI QIDQ3063609

A. M. Mobasseri, M. E. Masoumi, Ahmad Reza Rezaei

Publication date: 15 December 2010

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

line digraphshortest path algorithmmax flow-min cost problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Some properties of line digraphs
• Maximal Flow Through a Network
• On a routing problem

This page was built for publication: MINIMUM FLOW VARIATION IN MAXIMUM FLOWS