Algorithms for finding the minimum cycle mean in the weighted directed graph
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.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
1998-03-01
|
| Series: | Computer Science Journal of Moldova |
| Online Access: | http://www.math.md/nrofdownloads.php?file=/files/csjm/v6-n1/v6-n1-(pp27-34).pdf |
| Summary: | 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. |
|---|---|
| ISSN: | 1561-4042 |