Extreme flows in transport network
One of the most interesting and important optimization problems in graph theory is the problem of extreme flow definition in the given network. the network flow theory has developed from the need to solve some practical problems which occur most often in transportation. Such problem, for example, is the defining of optimal transportation flow on the road network of a city or its wider area. This paper analyses different types of static homogenous flows (one-side limited flow, flows in the networks with special constrains, etc.). Special attention is paid to the problem of the existence of such flows, which present one of the most important problems in the total network flow theory. The paper formulates the problems, explaining then the basic ideals of algorithms that are to be used to solve adequate optimization problem.