{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T05:38:13Z","timestamp":1673415493449},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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":4095,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0166-218x(01)00201-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:07:35Z","timestamp":1027580855000},"page":"279-291","source":"Crossref","is-referenced-by-count":8,"title":["Finding all the negative cycles in a directed graph"],"prefix":"10.1016","volume":"118","author":[{"given":"Takeo","family":"Yamada","sequence":"first","affiliation":[]},{"given":"Harunobu","family":"Kinoshita","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00201-3_BIB1","series-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0166-218X(01)00201-3_BIB2","series-title":"Computer Algorithms: Introduction to Design and Analysis","author":"Baase","year":"1993"},{"key":"10.1016\/S0166-218X(01)00201-3_BIB3","series-title":"Finite Graphs and Networks: an Introduction with Applications","author":"Busacker","year":"1965"},{"key":"10.1016\/S0166-218X(01)00201-3_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230110102","article-title":"A Comparison of three algorithms for finding fundamental cycles in a directed graph","volume":"11","author":"Chen","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(01)00201-3_BIB5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/S0166-218X(01)00201-3_BIB6","series-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(01)00201-3_BIB7","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","article-title":"A characterization of the minimum cycle mean in a digraph","volume":"23","author":"Karp","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00201-3_BIB8","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/S0166-218X(01)00201-3_BIB9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","article-title":"Bounds on backtrack algorithms for listing cycles, paths, and spanning trees","volume":"5","author":"Read","year":"1975","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(01)00201-3_BIB10","series-title":"Algorithms in C","author":"Sedgewick","year":"1998"},{"key":"10.1016\/S0166-218X(01)00201-3_BIB11","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1137\/0202017","article-title":"Enumeration of elementary circuits of a directed graph","volume":"2","author":"Tarjan","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(01)00201-3_BIB12","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1145\/362814.362819","article-title":"An efficient search algorithm to find the elementary circuits of a graph","volume":"13","author":"Tiernan","year":"1970","journal-title":"Comm. ACM"},{"key":"10.1016\/S0166-218X(01)00201-3_BIB13","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/321679.321684","article-title":"A new search algorithm for finding the simple cycles of a finite directed graph","volume":"19","author":"Weinblatt","year":"1973","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(01)00201-3_BIB14","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1145\/321328.321331","article-title":"A mechanical analysis of the cyclic structure of undirected linear graphs","volume":"13","author":"Welch","year":"1966","journal-title":"J. ACM"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002013?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002013?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T00:10:36Z","timestamp":1578442236000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0166218X01002013"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00201-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}