{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T16:07:05Z","timestamp":1780502825085,"version":"3.54.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1977,2,1]],"date-time":"1977-02-01T00:00:00Z","timestamp":223603200000},"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":13315,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1977,2]]},"DOI":"10.1016\/0304-3975(77)90056-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"59-76","source":"Crossref","is-referenced-by-count":77,"title":["Algebraic structures for transitive closure"],"prefix":"10.1016","volume":"4","author":[{"given":"Daniel J.","family":"Lehmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(77)90056-1_BIB1","first-page":"195","article-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(77)90056-1_BIB2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1093\/imamat\/15.2.161","article-title":"Regular algebra applied to path-finding problems","volume":"15","author":"Backhouse","year":"1975","journal-title":"J. Inst. Math. Appl."},{"key":"10.1016\/0304-3975(77)90056-1_BIB3","first-page":"109","article-title":"Regular Algebra and Finite Machines","author":"Conway","year":"1971"},{"key":"10.1016\/0304-3975(77)90056-1_BIB4","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."},{"issue":"6","key":"10.1016\/0304-3975(77)90056-1_BIB5","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","article-title":"Algorithm 97: shortest path","volume":"5","author":"Floyd","year":"1962","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(77)90056-1_BIB6","first-page":"77","article-title":"Alg\u00e8bre lin\u00e9aire et Cheminement dans un graphe","volume":"9","author":"Gondran","year":"1975","journal-title":"R.A.I.R.O."},{"issue":"1","key":"10.1016\/0304-3975(77)90056-1_BIB7","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321921.321938","article-title":"Global data flow analysis and iterative algorithms","volume":"23","author":"Kam","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(77)90056-1_BIB8","series-title":"Automata Studies","first-page":"3","article-title":"Representation of events in nerve nets and finite automata","author":"Kleene","year":"1956"},{"key":"10.1016\/0304-3975(77)90056-1_BIB9","series-title":"Theory of Computation Report No. 10","article-title":"Algebraic structures for transitive closure","author":"Lehmann","year":"1976"},{"key":"10.1016\/0304-3975(77)90056-1_BIB10","first-page":"216","article-title":"Transitivit\u00e9 et connexit\u00e9","volume":"249","author":"Roy","year":"1959","journal-title":"C.R. Acad. Sci."},{"key":"10.1016\/0304-3975(77)90056-1_BIB11","series-title":"Technical Report","article-title":"Solving path problems on directed graphs","author":"Tarjan","year":"1975"},{"key":"10.1016\/0304-3975(77)90056-1_BIB12","doi-asserted-by":"crossref","unstructured":"R.E. Tarjan, Graph theory and Gaussian elimination, in J. Bunch and D. Rose, eds., Sparse Matrix Computations (Academic Press, New York, to appear).","DOI":"10.1016\/B978-0-12-141050-6.50006-4"},{"issue":"1","key":"10.1016\/0304-3975(77)90056-1_BIB13","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":"J. ACM"},{"key":"10.1016\/0304-3975(77)90056-1_BIB14","doi-asserted-by":"crossref","first-page":"552","DOI":"10.2307\/2311149","article-title":"A note on a generalisation of boolean matrix theory","volume":"68","author":"Yoeli","year":"1961","journal-title":"Amer. Math. Monthly"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397577900561?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397577900561?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:21:43Z","timestamp":1555125703000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397577900561"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,2]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1977,2]]}},"alternative-id":["0304397577900561"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(77)90056-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1977,2]]}}}