CYCLES WITH MINIMUM AVERAGE LENGTH
Alain Fillieres · 1967
Abstract : 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.