Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Algorithms of choice of optimal configurations in weighted digraphs. (Russian)
Authors: Lozovanu Dmitrii, Solomon Zh. I.
Abstract
The problem of finding an optimal forest with defined number of base nodes for oriented weighted graph is formulated and researched. The results that are the basis for elaborating polinomial algorithm for problems solving are presented in this article.Institutul de Matematica Academia de Stiinte a Moldovei
str. Academiei 5, MD-2028 Chisinau, Moldova
str. Academiei 5, MD-2028 Chisinau, Moldova
Contents
- Morita contexts and correspondences between lattices of submodules. (Russian)
- A theorem on union of $d$-star-shaped sets. (Russian)
- Planar point groups of tablets and hypertablets $P$-symmetries and their application to the study of multidimensional symmetry groups. (Russian)
- On the generalized Fibonacci sequence. (English)
- Idempotents and the radical with respect to a right ideal. II. (Russian)
- Concordant solutions of linear multidimensional differential equations. (Russian)
- On the completeness of topological modules free in some classes. (English)
- The principle of composition of multidimensional dynamical systems. (Russian)
- Algorithms of choice of optimal configurations in weighted digraphs. (Russian)
- The construction of a numerable collection of precomplete classes of formulae in the provability logic. (English)
- On the strong isomorphism of groups and isomorphism of $P$-symmetries. (Russian)
- Uniqueness of topologies in the case of some constructions of rings and modules. (Russian)
