Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
An algorithm and a program for finding the minimax path tree in weighted digraphs
Authors: R. Boliac
– 0.13 Mb
Abstract
An algorithm for finding the minimax path tree in a weighted digraph and a program in PASCAL, which implements this algorithm, are presented in this paper.Rodica Boliac,
Institute of Mathematics,
Academy of Sciences of Moldova,
5 Academiei str., Kishinev
2028, Moldova.
e-mail:
Institute of Mathematics,
Academy of Sciences of Moldova,
5 Academiei str., Kishinev
2028, Moldova.
e-mail:
Fulltext
– 0.13 Mb
Contents
- SINGULAR A Computer Algebra System for Singularity Theory, Algebraic Geometry and Commutative Algebra
- Software encryption: new 64-bit block cryptoscheme
- Optimal efficiency indexes for iterative methods of interpolatory type
- The approximate solution of singular integro- differential equations on smooth contours in the spaces Lp
- An algorithm and a program for finding the minimax path tree in weighted digraphs
- Communication Facilities for Distributed Systems
- Mathematical methods and computer facilities in economic reserches
- The methods and computer structures for adaptive Fourier descriptive image analysis
