scientific article; zbMATH DE number 1062936

MaRDI QIDQ4355372zbMATH OpenFDO

Authors L. N. Baturina, N. A. Lepeshinskij

Publication date 15 December 1997

zbMATH Keywords

algorithmmaximal flowsimple paths

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15)

Recommendations

• The maximum flow problem in a network with special conditions of flow distribution
• Constructing maximal dynamic flows from static flows
• scientific article; zbMATH DE number 4053314
• scientific article; zbMATH DE number 988194
• scientific article; zbMATH DE number 706868

Cited in

(24)

• Playing with the Maximum-Flow Problem
• Construction of simple path graphs in transport networks. I: General solutions and examples
• scientific article; zbMATH DE number 4053314 (Why is no real title available?)
• Maximum flow problem in the distribution network
• scientific article; zbMATH DE number 45131 (Why is no real title available?)
• Determination of the maximal steady state flow of traffic through a railroad network
• scientific article; zbMATH DE number 4131955 (Why is no real title available?)
• Maximal flow in possibilistic networks
• The Maximum Flow Problem for Oriented Flows
• Flows on few paths: Algorithms and lower bounds
• A measure-theoretical max-flow problem
• The Maximum Labeled Path Problem
• scientific article; zbMATH DE number 3950169 (Why is no real title available?)
• Step graphs and their application to the organization of commodity flows in networks
• scientific article; zbMATH DE number 4158666 (Why is no real title available?)
• The maximum flow problem in a network with special conditions of flow distribution
• scientific article; zbMATH DE number 3908126 (Why is no real title available?)
• scientific article; zbMATH DE number 67667 (Why is no real title available?)
• scientific article; zbMATH DE number 3943526 (Why is no real title available?)
• Method of calculating the maximum flow in network picture
• An approximate polynomial method for solving a combinatorial problem of finding the maximum flow in a network
• scientific article; zbMATH DE number 706868 (Why is no real title available?)
• scientific article; zbMATH DE number 3970465 (Why is no real title available?)
• A note on practical construction of maximum bandwidth paths.

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