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 95
- Downloads 0
ROCK BURSTS – THE CAUSE OF METHANE EMISSIONS IN THE COAL MINE?
The model, which hit a mountain (technogenic earthquakes) — is presented as a way out of the shock wave at the inner wall of the shaft. This raises the unloading wave, stretching, moving backward (deep wall) direction. S...
ON THE QUESTION OF THE CONSTRUCTION OF COGNITIVE MAPS FOR DATA MINING
A method of constructing an optimal cognitive maps consists in optimizing the input data and the dimension data structure of a cognitive map. Pro-optimization problem occurs when large amounts of input data. Optimization...
ON SOME NEW ESTIMATES RELATED WITH BERGMAN BALL AND POISSON INTEGRAL IN TUBULAR DOMAIN AND UNIT BALL
We introduce new Herz type analytic spaces based on Bergman balls in tubular domains over symmetric cones and in products of such type domains. We provide for these Herz type spaces new maximal and embedding theorems ext...
NUMERICAL SOLUTION OF OF DIFFUSION – ADVECTION EQUATION OF RADON TRANSPORT IN MANY-LAYERED GEOLOGICAL MEDIA
The solutions of stationary and non-stationary diffusion-advection equations of radon transport in many-layered geological media by integro-interpolation method are presented
SPECTRAL PROBLEMS FOR THREE-DIMENSIONAL ELLIPTIC EQUATIONS WITH SINGULAR COEFFICIENTS
The eigenvalues and eigenfunctions of two boundary value problems for three-dimensional equations of elliptic types with singular coefficients with lower terms are found.