@article{Karp1978309,
    Abstract = {Let C = (V,E) be a digraph with n vertices. Let f be a function from E into the real numbers, associating with each edge e ∈ E a weightƒ(e). Given any sequence of edges σ = e1,e2,{\ldots},ep define w(σ), the weight of σ, as ∑i = 1p ƒ(ei), and define m(σ), the mean weight of σ, as w(σ)⧸p. Let {$\lambda$}∗ = minCm(C) where C ranges over all directed cycles in G; {$\lambda$}∗ is called the minimum cycle mean. We give a simple characterization of {$\lambda$}∗, as well as an algorithm for computing it efficiently.},
    Author = {Karp, Richard M.},
    File = {A characterization of the minimum cycle mean in a digraph - Karp (0) (0) - a - a - h.pdf},
    ISSN = {0012-365X},
    Journal = {Discrete Mathematics},
    Keywords = {classic},
    Number = {3},
    Pages = {309 - 311},
    Title = {A characterization of the minimum cycle mean in a digraph},
    URL = {http://www.sciencedirect.com/science/article/pii/0012365X78900110},
    Volume = {23},
    Year = {1978},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/0012365X78900110},
    bdsk-url-2 = {http://dx.doi.org/10.1016/0012-365X(78)90011-0},
    date-added = {2014-08-18 08:37:15 +0000},
    date-modified = {2014-08-18 08:54:53 +0000},
    doi = {10.1016/0012-365X(78)90011-0}
}

@article{Karp1978309, Abstract = {Let C = (V,E) be a digraph with n vertices. Let f be a function from E into the real numbers, associating with each edge e ∈ E a weightƒ(e). Given any sequence of edges σ = e1,e2,{\ldots},ep define w(σ), the weight of σ, as ∑i = 1p ƒ(ei), and define m(σ), the mean weight of σ, as w(σ)⧸p. Let {$\lambda$}∗ = minCm(C) where C ranges over all directed cycles in G; {$\lambda$}∗ is called the minimum cycle mean. We give a simple characterization of {$\lambda$}∗, as well as an algorithm for computing it efficiently.}, Author = {Karp, Richard M.}, File = {A characterization of the minimum cycle mean in a digraph - Karp (0) (0) - a - a - h.pdf}, ISSN = {0012-365X}, Journal = {Discrete Mathematics}, Keywords = {classic}, Number = {3}, Pages = {309 - 311}, Title = {A characterization of the minimum cycle mean in a digraph}, URL = {http://www.sciencedirect.com/science/article/pii/0012365X78900110}, Volume = {23}, Year = {1978}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/0012365X78900110}, bdsk-url-2 = {http://dx.doi.org/10.1016/0012-365X(78)90011-0}, date-added = {2014-08-18 08:37:15 +0000}, date-modified = {2014-08-18 08:54:53 +0000}, doi = {10.1016/0012-365X(78)90011-0} }