{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T04:02:57Z","timestamp":1648699377572},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1973,6,1]],"date-time":"1973-06-01T00:00:00Z","timestamp":107740800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1973,6]]},"DOI":"10.1016\/0020-0190(73)90010-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:20:15Z","timestamp":1027642815000},"page":"39-42","source":"Crossref","is-referenced-by-count":2,"title":["On computing the time complexity of transitive closure algorithms"],"prefix":"10.1016","volume":"2","author":[{"given":"Jo\u00ebl","family":"Coffy","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(73)90010-0_BIB1","series-title":"Th\u00e9orie des graphes et ses applications","author":"Berge","year":"1967"},{"key":"10.1016\/0020-0190(73)90010-0_BIB2","series-title":"Graph theory","author":"Harary","year":"1969"},{"key":"10.1016\/0020-0190(73)90010-0_BIB3","series-title":"Rapport Laboria no. 10","article-title":"On computing the time complexity of transitive closure algorithms","author":"Coffy","year":"1973"},{"key":"10.1016\/0020-0190(73)90010-0_BIB4","volume":"vol. 1","author":"Knuth","year":"1968"},{"key":"10.1016\/0020-0190(73)90010-0_BIB5","series-title":"Comp. Sc. Techn. Rep. No. 33","article-title":"A transitive closure algorithm","author":"Purdom","year":"1968"},{"key":"10.1016\/0020-0190(73)90010-0_BIB6","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BF01940892","article-title":"A transitive closure algorithm","volume":"10","author":"Purdom","year":"1970","journal-title":"BIT"},{"key":"10.1016\/0020-0190(73)90010-0_BIB7","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","article-title":"A theorem on boolean matrices","volume":"9","author":"Warshall","year":"1962","journal-title":"JACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019073900100?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019073900100?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T08:50:45Z","timestamp":1555059045000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019073900100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973,6]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1973,6]]}},"alternative-id":["0020019073900100"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(73)90010-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1973,6]]}}}