{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T11:51:23Z","timestamp":1774957883576,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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,1]]},"DOI":"10.1016\/0020-0190(94)90047-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"9-14","source":"Crossref","is-referenced-by-count":118,"title":["On finding the strongly connected components in a directed graph"],"prefix":"10.1016","volume":"49","author":[{"given":"Esko","family":"Nuutila","sequence":"first","affiliation":[]},{"given":"Eljas","family":"Soisalon-Soininen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90047-7_BIB1","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/0020-0190(94)90047-7_BIB2","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)90047-7_BIB3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0020-0190(93)90011-W","article-title":"I\/O- and CPU-optimal recognition of strongly connected components","volume":"45","author":"Jiang","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)90047-7_BIB4","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"},{"key":"10.1016\/0020-0190(94)90047-7_BIB5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0898-1221(81)90008-0","article-title":"A strong-connectivity algorithm and its application in data flow analysis","volume":"7","author":"Sharir","year":"1981","journal-title":"Comput. Math. Appl."},{"issue":"2","key":"10.1016\/0020-0190(94)90047-7_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":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900477?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900477?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:29:08Z","timestamp":1555144148000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094900477"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0020019094900477"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90047-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}