RO  EN
IMI/Publicaţii/CSJM/Ediţii/CSJM v.6, n.1 (16), 1998/

Algorithms for finding the minimum cycle mean in the weighted directed graph

Authors: Lozovanu Dmitrii, C. Petic

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:

Fulltext

Adobe PDF document0.12 Mb