{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:28:41Z","timestamp":1773271721550,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"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":[[1994,11]]},"DOI":"10.1016\/0020-0190(94)90128-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"207-213","source":"Crossref","is-referenced-by-count":17,"title":["An efficient transitive closure algorithm for cyclic digraphs"],"prefix":"10.1016","volume":"52","author":[{"given":"Esko","family":"Nuutila","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90128-7_BIB1","series-title":"Random Graphs","author":"Boll\u00f3bas","year":"1985"},{"key":"10.1016\/0020-0190(94)90128-7_BIB2","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0020-0190(81)90026-0","article-title":"A sensitive transitive closure algorithm","volume":"12","author":"Ebert","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)90128-7_BIB3","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00271339","article-title":"On computing the transitive closure of a relation","volume":"8","author":"Eve","year":"1977","journal-title":"Acta Inform."},{"issue":"3","key":"10.1016\/0020-0190(94)90128-7_BIB4","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1145\/155271.155273","article-title":"Transitive closure algorithms based on graph traversal","volume":"18","author":"Ioannidis","year":"1993","journal-title":"ACM Trans. Database Systems"},{"issue":"1","key":"10.1016\/0020-0190(94)90128-7_BIB5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1002\/rsa.3240010106","article-title":"The transitive closure of a random digraph","volume":"1","author":"Karp","year":"1990","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/0020-0190(94)90128-7_BIB6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0020-0190(94)90047-7","article-title":"On finding the strongly connected components in a directed graph","volume":"49","author":"Nuutila","year":"1994","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/0020-0190(94)90128-7_BIB7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/78919.78921","article-title":"Steady-state simulation of queueing processes: A survey of problems and solutions","volume":"22","author":"Pawlikowski","year":"1990","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0020-0190(94)90128-7_BIB8","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(94)90128-7_BIB9","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF02242140","article-title":"An improved transitive closure algorithm","volume":"30","author":"Schmitz","year":"1983","journal-title":"Computing"},{"issue":"2","key":"10.1016\/0020-0190(94)90128-7_BIB10","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":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094901287?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094901287?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:52:23Z","timestamp":1555145543000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094901287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["0020019094901287"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90128-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,11]]}}}