{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T14:09:19Z","timestamp":1673705359442},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"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":4429,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s0166-218x(00)00304-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:03:32Z","timestamp":1027634612000},"page":"77-84","source":"Crossref","is-referenced-by-count":3,"title":["Transitive closure algorithm MEMTC and its performance analysis"],"prefix":"10.1016","volume":"110","author":[{"given":"Vesa","family":"Hirvisalo","sequence":"first","affiliation":[]},{"given":"Esko","family":"Nuutila","sequence":"additional","affiliation":[]},{"given":"Eljas","family":"Soisalon-Soininen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00304-8_BIB1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, A. Borgida, H.V. Jagadish, Efficient management of transitive relationships in large data and knowledge bases, Proceedings of the ACM-SIGMOD 1989 Conference on Management of Data, Portland, Oregon, May\u2013June 1989, pp. 253\u2013262.","DOI":"10.1145\/67544.66950"},{"issue":"3","key":"10.1016\/S0166-218X(00)00304-8_BIB2","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/88636.88888","article-title":"Direct transitive closure algorithms: design and performance evaluation","volume":"15","author":"Agrawal","year":"1990","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/S0166-218X(00)00304-8_BIB3","unstructured":"R. Agrawal, H.V. Jagadish, Hybrid transitive closure algorithms, Proceedings of the 16th International VLDB Conference, Brisbane, Australia, 1990, pp. 326\u2013334."},{"key":"10.1016\/S0166-218X(00)00304-8_BIB4","doi-asserted-by":"crossref","unstructured":"S. Dar, R. Ramakrishnan, A performance study of transitive closure algorithms, Proceedings of the ACM-SIGMOD 1994 Conference on Management of Data, 1994.","DOI":"10.1145\/191839.191928"},{"key":"10.1016\/S0166-218X(00)00304-8_BIB5","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\/S0166-218X(00)00304-8_BIB6","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."},{"key":"10.1016\/S0166-218X(00)00304-8_BIB7","unstructured":"V. Hirvisalo, DBE \u2014 a tool for trace driven memory simulation, Tool Descriptions of Ninth International Conference on Modelling Techniques and Tools for Computer Performance Evaluation (TOOLS\u201997), St. Malo, France, June 1997."},{"issue":"3","key":"10.1016\/S0166-218X(00)00304-8_BIB8","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"},{"key":"10.1016\/S0166-218X(00)00304-8_BIB9","doi-asserted-by":"crossref","unstructured":"B. Jiang, A suitable algorithm for computing partial transitive closures in databases, Proceedings of the IEEE Sixth International Conference on Data Engineering, Los Angeles, CA, February 1990, pp. 264\u2013271.","DOI":"10.1109\/ICDE.1990.113477"},{"issue":"5","key":"10.1016\/S0166-218X(00)00304-8_BIB10","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/0306-4379(92)90035-L","article-title":"Performance evaluation of algorithms for transitive closure","volume":"17","author":"Kabler","year":"1992","journal-title":"Inform. Systems"},{"issue":"1","key":"10.1016\/S0166-218X(00)00304-8_BIB11","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\/S0166-218X(00)00304-8_BIB12","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0020-0190(94)90128-7","article-title":"An efficient transitive closure algorithm for cyclic digraphs","volume":"52","author":"Nuutila","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(00)00304-8_BIB13","unstructured":"E. Nuutila, Efficient transitive closure computation in large digraphs, Ph.D. Thesis, Helsinki University of Technology, Acta Polytechnica Scandinavica, Mathematics and Computing in Engineering Series, No. 74, 1995."},{"key":"10.1016\/S0166-218X(00)00304-8_BIB14","unstructured":"E. Nuutila, E. Soisalon-Soininen, Efficient transitive closure computation, Technical Report TKO-B113, Helsinki University of Technology, Laboratory of Information Processing Science, 1993."},{"key":"10.1016\/S0166-218X(00)00304-8_BIB15","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 E. Soisalon-Soininen","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(00)00304-8_BIB16","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\/S0166-218X(00)00304-8_BIB17","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\/S0166-218X(00)00304-8_BIB18","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":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003048?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003048?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T16:50:12Z","timestamp":1555692612000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0166218X00003048"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00304-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}