{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:55:55Z","timestamp":1777460155135,"version":"3.51.4"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,5,1]],"date-time":"2004-05-01T00:00:00Z","timestamp":1083369600000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,5]]},"DOI":"10.1016\/s0377-2217(02)00730-0","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:20:01Z","timestamp":1047648001000},"page":"226-238","source":"Crossref","is-referenced-by-count":44,"title":["Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation"],"prefix":"10.1016","volume":"155","author":[{"given":"H.","family":"De Meyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Naessens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"De Baets","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00730-0_BIB1","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0165-0114(88)90126-1","article-title":"Special properties, closures and interiors of crisp and fuzzy relations","volume":"26","author":"Bandler","year":"1988","journal-title":"Fuzzy. Set. Syst."},{"key":"10.1016\/S0377-2217(02)00730-0_BIB2","unstructured":"B. DeBaets, H. De Meyer, On the existence and construction of T-transitive closures, Inform. Sci., in press"},{"key":"10.1016\/S0377-2217(02)00730-0_BIB3","first-page":"310","article-title":"A graph-theoretical analysis of pattern classification via Tamura\u2019s fuzzy relation","volume":"5","author":"Dunn","year":"1974","journal-title":"IEEE Trans. SMC"},{"key":"10.1016\/S0377-2217(02)00730-0_BIB4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0020-0190(97)00113-0","article-title":"Abstract derivation of transitive closure algorithms","volume":"63","author":"Feijs","year":"1997","journal-title":"Inform. Proc. Lett."},{"key":"10.1016\/S0377-2217(02)00730-0_BIB5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0165-0114(92)90191-6","article-title":"An algorithm for computing the transitive closure of a fuzzy similarity matrix","volume":"51","author":"Guoyao","year":"1992","journal-title":"Fuzzy. Set. Syst."},{"key":"10.1016\/S0377-2217(02)00730-0_BIB6","first-page":"472","article-title":"Fuzzy chains","volume":"5","author":"Kandel","year":"1974","journal-title":"IEEE Trans. SMC"},{"key":"10.1016\/S0377-2217(02)00730-0_BIB7","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0020-0190(00)00064-8","article-title":"An optimal O(N2) algorithm for computing the min-transitive closure of a weighted graph","volume":"74","author":"Kundu","year":"2000","journal-title":"Inform. Proc. Lett."},{"key":"10.1016\/S0377-2217(02)00730-0_BIB8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0165-0114(90)90101-B","article-title":"Efficient computation of transitive closures","volume":"38","author":"Larsen","year":"1990","journal-title":"Fuzzy. Set. Syst."},{"key":"10.1016\/S0377-2217(02)00730-0_BIB9","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0165-0114(90)90102-C","article-title":"The simplest method of ascending value to find fuzzy transitive closure","volume":"38","author":"Li","year":"1990","journal-title":"Fuzzy. Set. Syst."},{"key":"10.1016\/S0377-2217(02)00730-0_BIB10","series-title":"Algorithms Sequential and Parallel, a Unified Approach","author":"Miller","year":"2000"},{"key":"10.1016\/S0377-2217(02)00730-0_BIB11","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/TFUZZ.2002.800654","article-title":"Algorithms for the computation of T-transitive closures","volume":"10","author":"Naessens","year":"2002","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"10.1016\/S0377-2217(02)00730-0_BIB12","doi-asserted-by":"crossref","unstructured":"J. Ullman, M. Yannakis, The input\/output complexity of transitive closure, in: Proceedings of the ACM-SIGMOD 1990 International Conference on Management of Data, pp. 44\u201353, 1990","DOI":"10.1145\/93597.93620"},{"key":"10.1016\/S0377-2217(02)00730-0_BIB13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0020-0255(71)80005-1","article-title":"Similarity relations and fuzzy orderings","volume":"3","author":"Zadeh","year":"1971","journal-title":"Inform. Sci."}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007300?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007300?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T07:54:45Z","timestamp":1553586885000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702007300"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["S0377221702007300"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00730-0","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}