RO EN
Algorithms for finding the minimum cycle mean in the weighted directed graph
Authors: Lozovanu Dmitrii, C. Petic
– 0.12 Mb
Abstract
In this paper we study the problem of finding the minimum cycle mean in the weighted directed graph. The computational aspect of some algorithms for solving this problem is discussed and two algorithms for minimum cycle mean finding in the weighted directed graph are proposed.D.Lozovanu, C.Petic,
Institute of mathematics,
Academy of Sciences of Moldova,
5 Academiei str., Kishinev,
MD-2028, Moldova
e-mail:
Institute of mathematics,
Academy of Sciences of Moldova,
5 Academiei str., Kishinev,
MD-2028, Moldova
e-mail:
Fulltext
– 0.12 Mb
Contents
- Syntesis of group project decisions in distributed computer decision support systems
- Algorithms for finding the minimum cycle mean in the weighted directed graph
- Stability, pseudostability and quasistability of vector trajectorial lexicographic optimization problem
- Some small self-describing Turing machines
- Direct methods for solving singular integral equations with complex conjugation
- Direct methods for solving singular integral equations with shifts in the unit circle
