scientific article; zbMATH DE number 1062936
From MaRDI portal
Publication:4355372
zbMATH Open0882.05115MaRDI QIDQ4355372FDOQ4355372
Authors: L. N. Baturina, N. A. Lepeshinskij 
Publication date: 15 December 1997
Title of this publication is not available (Why is that?)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15)
Cited In (24)
- Title not available (Why is that?)
- Construction of simple path graphs in transport networks. I: General solutions and examples
- Maximum flow problem in the distribution network
- Title not available (Why is that?)
- Determination of the maximal steady state flow of traffic through a railroad network
- Title not available (Why is that?)
- The Maximum Flow Problem for Oriented Flows
- Flows on few paths: Algorithms and lower bounds
- A measure-theoretical max-flow problem
- Maximal flow in possibilistic networks
- The Maximum Labeled Path Problem
- Title not available (Why is that?)
- Step graphs and their application to the organization of commodity flows in networks
- Title not available (Why is that?)
- The maximum flow problem in a network with special conditions of flow distribution
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on practical construction of maximum bandwidth paths.
- Playing with the Maximum-Flow Problem
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)
