RO EN
An algorithm for finding the minimax paths in networks. (Russian)
Authors: Prodan N. V.
Abstract
Using the dinamical programming method an algoritm for computing the tree of minimax paths in an admisible network was developed.Contents
- Generalized nonlocal splines with one free generating function. Estimations of interpolation accuracy. (English)
- Stability properties of delay systems under a Taylor series representation. (English)
- Derivation of nontrivial subgroups and minimal systems of generators of point crystallographic groups by means of a computer. (Russian)
- Berge-acyclic database schemes. (Romanian)
- Frieze groups of two-sided rosette $P$-symmetries and their geometric applications. (Russian)
- Solution of the problem of completeness with respect to expressibility in a $5$-valued nonchain extension of duality intuitionistic logic. (Russian)
- Numerical analysis of a problem on wave propagation in a viscoelastic rod. (Russian)
- Construction of quasi-affine axiomatics of Lobachevskij geometry. (Russian)
- Monoquasigroups without congruences and automorphisms. (Russian)
- An algorithm for finding the minimax paths in networks. (Russian)
- A universal Turing machine with $10$ states and $3$ symbols. (Russian)
- On the $L_p$-boundedness of the resolvent operator of the Cauchy problem for a higher-order one-dimensional hyperbolic equation. (Russian)
