{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,12]],"date-time":"2026-04-12T18:37:57Z","timestamp":1776019077161,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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":7471,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1016\/0012-365x(93)90164-o","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"289-303","source":"Crossref","is-referenced-by-count":17,"title":["On the calculation of transitive reduction\u2014closure of orders"],"prefix":"10.1016","volume":"111","author":[{"given":"M.","family":"Habib","sequence":"first","affiliation":[]},{"given":"M.","family":"Morvan","sequence":"additional","affiliation":[]},{"given":"J.-X.","family":"Rampon","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90164-O_BIB1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0201008","article-title":"The transitive reduction of a directed graph","volume":"1, 2","author":"Aho","year":"1972","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0012-365X(93)90164-O_BIB2","first-page":"1209","article-title":"On economical construction of the transitive closure of an oriented graph","volume":"194","author":"Arlazarov","year":"1970","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0012-365X(93)90164-O_BIB3","series-title":"Extremal Graph Theory","author":"Bollob\u00e0s","year":"1978"},{"key":"10.1016\/0012-365X(93)90164-O_BIB4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1051\/ita\/1987210201811","article-title":"Complexit\u00e9 de probl\u00e8mes li\u00e9s aux graphes sans circuits","volume":"21","author":"Bordat","year":"1987","journal-title":"Informatique Th\u00e9orique et Applications"},{"key":"10.1016\/0012-365X(93)90164-O_BIB5","first-page":"1","article-title":"Matrix multiplication via arithmetic progressions","author":"Coppersmith","year":"1987","journal-title":"Proc. 19th Ann. Symp. on the Theory of Computation"},{"key":"10.1016\/0012-365X(93)90164-O_BIB6","first-page":"129","article-title":"Boolean matrix multiplication and transitive closure","author":"Fisher","year":"1971","journal-title":"Conference Record"},{"issue":"3","key":"10.1016\/0012-365X(93)90164-O_BIB7","first-page":"1252","article-title":"Application of a method of fast multiplication of matrices in the problem of finding the transitive closure of a graph","volume":"194","author":"Furman","year":"1970","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"10.1016\/0012-365X(93)90164-O_BIB8","first-page":"301","article-title":"A reduct and closure algorithm for graphs","author":"Goralcikova","year":"1979","journal-title":"Math. Foundations Comput. Sci."},{"key":"10.1016\/0012-365X(93)90164-O_BIB9","series-title":"Proc. WG 90","article-title":"Transitive closure for restricted classes of partial orders","author":"Ma","year":"1991"},{"key":"10.1016\/0012-365X(93)90164-O_BIB10","series-title":"Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/0012-365X(93)90164-O_BIB11","article-title":"Algorithmes lin\u00e9aires et invariants d'ordres","volume":"II","author":"Morvan","year":"1991"},{"key":"10.1016\/0012-365X(93)90164-O_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/58562.59300","article-title":"Incremental modular decomposition","volume":"36","author":"Muller","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/0012-365X(93)90164-O_BIB13","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\/0012-365X(93)90164-O_BIB14","doi-asserted-by":"crossref","first-page":"127","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\/0012-365X(93)90164-O_BIB15","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\/0012-365X(93)90164-O_BIB16","first-page":"245","article-title":"Finding a minimal transitive reduction in a strongly connected digraph within linear time","volume":"Vol. 411","author":"Simon","year":"1990"},{"key":"10.1016\/0012-365X(93)90164-O_BIB17","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The recognition of series-parallel digraphs","volume":"11","author":"Valdes","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(93)90164-O_BIB18","first-page":"11","article-title":"A theorem on boolean matrices","author":"Warshall","year":"1962"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390164O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390164O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:51:48Z","timestamp":1555120308000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9390164O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":18,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["0012365X9390164O"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90164-o","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}