{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T07:27:48Z","timestamp":1758094068184,"version":"3.44.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100001823","name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001823","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0020-0190(01)00245-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:34:32Z","timestamp":1027593272000},"page":"289-296","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["Algorithms for transitive closure"],"prefix":"10.1016","volume":"81","author":[{"given":"A.","family":"Koubkov\u00e1","sequence":"first","affiliation":[]},{"given":"V.","family":"Koubek","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1976","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","key":"10.1016\/S0020-0190(01)00245-9_BIB001"},{"key":"10.1016\/S0020-0190(01)00245-9_BIB002","series-title":"Proc. of 12th Annual Symp. on Switching and Automata Theory","first-page":"129","article-title":"Boolean matrix multiplication and transitive closure","author":"Fischer","year":"1971"},{"key":"10.1016\/S0020-0190(01)00245-9_BIB003","series-title":"Proc. Math. Found. of Comp. Sci. 1979","first-page":"301","article-title":"A reduct and closure algorithm for graphs","volume":"74","author":"Goral\u010d\u0131́kov\u00e1","year":"1979"},{"key":"10.1016\/S0020-0190(01)00245-9_BIB004","series-title":"Data Structures and Algorithms II: Graph Algorithms and NP-Completeness","volume":"2","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/S0020-0190(01)00245-9_BIB005","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1137\/0207011","article-title":"An algorithm for transitive closure with linear expected time","volume":"7","author":"Schnorr","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(01)00245-9_BIB006","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0304-3975(88)90032-1","article-title":"An improved algorithm for transitive closure on acyclic digraphs","volume":"58","author":"Simon","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(01)00245-9_BIB007","series-title":"Algorithms \u2014 ESA'93 (Bad Honnef)","first-page":"345","article-title":"On the distribution of the transitive closure in a random acyclic digraph","volume":"726","author":"Simon","year":"1993"},{"key":"10.1016\/S0020-0190(01)00245-9_BIB008","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:S0020019001002459?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002459?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T03:22:42Z","timestamp":1758079362000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002459"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0020019001002459"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00245-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[2002,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Algorithms for transitive closure","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0020-0190(01)00245-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}