{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:09:56Z","timestamp":1759032596214},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,8,1]],"date-time":"1982-08-01T00:00:00Z","timestamp":397008000000},"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":["Information Sciences"],"published-print":{"date-parts":[[1982,8]]},"DOI":"10.1016\/0020-0255(82)90027-5","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"233-243","source":"Crossref","is-referenced-by-count":18,"title":["Reduction of a nilpotent fuzzy matrix"],"prefix":"10.1016","volume":"27","author":[{"given":"Hiroshi","family":"Hashimoto","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(82)90027-5_BIB1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0201008","article-title":"The transitive reduction of a directed graph","volume":"1","author":"Aho","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0255(82)90027-5_BIB2","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1145\/363397.363497","article-title":"Computer construction of project networks","volume":"11","author":"Fisher","year":"1968","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0255(82)90027-5_BIB3","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1145\/321033.321038","article-title":"On the consistency of precedence matrices","volume":"7","author":"Harary","year":"1960","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0255(82)90027-5_BIB4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321864.321866","article-title":"An algorithm for finding a minimal equivalent graph of a digraph","volume":"22","author":"Hsu","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0255(82)90027-5_BIB5","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1145\/320964.320973","article-title":"A new method of checking the consistency of precedence matrices","volume":"6","author":"Marimont","year":"1959","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0255(82)90027-5_BIB6","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1145\/321526.321534","article-title":"An algorithm for finding a minimum equivalent graph of a digraph","volume":"16","author":"Moyles","year":"1969","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0255(82)90027-5_BIB7","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0165-0114(81)90023-3","article-title":"Structure of fuzzy binary relations","volume":"6","author":"Ovchinnikov","year":"1981","journal-title":"Fuzzy Sets and Systems"},{"key":"10.1016\/0020-0255(82)90027-5_BIB8","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0095-8956(71)90053-0","article-title":"An algorithm for finding the essential sets of arcs of certain graphs","volume":"10","author":"Robert","year":"1971","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0020-0255(82)90027-5_BIB9","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1109\/TSMC.1976.5408785","article-title":"An efficient algorithm for constructing hierarchical graphs","volume":"SMC-6","author":"Yelowitz","year":"1976","journal-title":"IEEE Trans. Systems Man Cybernet."},{"key":"10.1016\/0020-0255(82)90027-5_BIB10","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":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025582900275?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025582900275?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T12:52:59Z","timestamp":1552913579000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025582900275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,8]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,8]]}},"alternative-id":["0020025582900275"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(82)90027-5","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1982,8]]}}}