CYCLES WITH MINIMUM AVERAGE LENGTH
CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
Pagination or Media Count:
Given a directed network whose arcs have lengths unrestricted in sign and which contains at least one cycle, an algorithm to find the minimum average length cycle length divided by its number of arcs is described. A direct application of this algorithm solves the problem of finding whether a directed graph contains a cycle with negative length.
- Theoretical Mathematics
- Operations Research