zbMATH — the first resource for mathematics

A characterization of the minimum cycle mean in a digraph. (English) Zbl 0386.05032

05C20 Directed graphs (digraphs), tournaments
05C38 Paths and cycles
05C35 Extremal problems in graph theory
05-04 Software, source code, etc. for problems pertaining to combinatorics
Full Text: DOI
[1] Danzig, G.B.; Blattner, W.; Rao, M.R., Finding a cycle in a graph with minimum cost to time ratio with application to a ship routing problem, (), 77-84, Gordon and Breach, New York
[2] Johnson, D.B., Algorithms for shortest paths, ()
[3] Lawler, E.L., Optimal cycles in doubly weighted linear graphs, (), 209-214, Gordon and Breach, New York · Zbl 0196.56301
[4] Lawler, E.L., Combinatorial optimization: networks and matroids, (1976), Holt, Rinehart and Winston New York · Zbl 0358.68059
[5] Romanovskii, L.V., Optimization of stationary control of a discrete deterministic process, Cybernetics, 3, 52-62, (1967)
[6] Tarjan, R.E., Depth-first search and linear graph algorithms, SIAM J. comput., 1, 146-160, (1972) · Zbl 0251.05107
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.