RANK OPTIMIZATION FOR FLOW NETWORKS
Journal Title: Вестник КРАУНЦ. Физико-математические науки - Year 2018, Vol 4, Issue
Abstract
In this paper we present an algorithm for constructing an optimal P-rank flow network in a specified redundant geometric graph with potential links of nodes.
Authors and Affiliations
Valery Kudaev, Mohammed Abazokov
Keywords
Related Articles
- EP ID EP505620
- DOI 10.18454/2079-6641-2018-24-4-178-185
- Views 72
- Downloads 0
CALCULATION THE MAXIMUM LYAPUNOV EXPONENT FOR THE OSCILLATORY SYSTEM OF DUFFING WITH A DEGREE MEMORY
In the study of nonlinear systems, one of the important problems is the determination of the type of oscillations-periodic, quasi-periodic, random, chaotic. It is especially difficult to distinguish between quasi-periodi...
CAUCHY PROBLEM FOR ORDINARY DIFFERENTIAL EQUATION WITH DISCRETELY DISTRIBUTED FRACTIONAL DIFFERENTIATION OPERATOR
We consider an initial value problem for ordinary differential equation with discretely distributed fractional differentiation operator. We give the Lagrange formula, prove the existence and uniqueness theorem and constr...
THE BOUNDARY VALUE PROBLEM FOR THE GENERALIZED MOISTURE TRANSFER EQUATION
In mathematical modeling of continuous media with memory, we deal with equations that describe a new type of wave motion, something between ordinary wave diffusion and classical wave propagation. There are fractional dif...
CAUCHY PROBLEM FOR THE SYSTEM OF EQUATIONS WITH PARTIAL DERIVATIVES OF FRACTIONAL ORDER
For a system of first-order equations with partial derivatives of fractional order in the Riemann-Liouville sense, we give a correct statement of the Cauchy problem in the case when the matrix coefficient in the main par...
ON SOME NEW ESTIMATES RELATED WITH DISTANCE FUNCTION FOR DIFFERENTIAL FORMS
In this short note we consider a new extremal problem for some general spaces of differential forms and provide some estimates for related distance function.