{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T14:49:22Z","timestamp":1775486962911,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12981,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1978]]},"DOI":"10.1016\/0012-365x(78)90011-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:33:13Z","timestamp":1027639993000},"page":"309-311","source":"Crossref","is-referenced-by-count":419,"title":["A characterization of the minimum cycle mean in a digraph"],"prefix":"10.1016","volume":"23","author":[{"given":"Richard M.","family":"Karp","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(78)90011-0_BIB1","series-title":"Theory of Graphs","first-page":"77","article-title":"Finding a cycle in a graph with minimum cost to time ratio with application to a ship routing problem","author":"Danzig","year":"1967"},{"key":"10.1016\/0012-365X(78)90011-0_BIB2","series-title":"Ph.D. Thesis","article-title":"Algorithms for shortest paths","author":"Johnson","year":"1973"},{"key":"10.1016\/0012-365X(78)90011-0_BIB3","series-title":"Theory of Graphs","first-page":"209","article-title":"Optimal cycles in doubly weighted linear graphs","author":"Lawler","year":"1967"},{"key":"10.1016\/0012-365X(78)90011-0_BIB4","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0012-365X(78)90011-0_BIB5","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/BF01078754","article-title":"Optimization of stationary control of a discrete deterministic process","volume":"3","author":"Romanovskii","year":"1967","journal-title":"Cybernetics"},{"key":"10.1016\/0012-365X(78)90011-0_BIB6","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78900110?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78900110?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:21:42Z","timestamp":1555140102000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X78900110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978]]}},"alternative-id":["0012365X78900110"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(78)90011-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1978]]}}}