{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T00:37:46Z","timestamp":1746319066034,"version":"3.37.3"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472339","61303040"],"award-info":[{"award-number":["61472339","61303040"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2975650","type":"journal-article","created":{"date-parts":[[2020,2,21]],"date-time":"2020-02-21T21:03:41Z","timestamp":1582319021000},"page":"38010-38022","source":"Crossref","is-referenced-by-count":7,"title":["One Edge at a Time: A Novel Approach Towards Efficient Transitive Reduction Computation on DAGs"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2311-2860","authenticated-orcid":false,"given":"Xian","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6494-5319","authenticated-orcid":false,"given":"Junfeng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaxian","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6420-9298","authenticated-orcid":false,"given":"Xiang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunyu","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingwen","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1145\/2247596.2247651"},{"key":"ref32","first-page":"509","article-title":"GRAIL: A scalable index for reachability queries in very large graphs","volume":"21","author":"y?ld?r?m","year":"2011","journal-title":"VLDB J"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.14778\/1920841.1920879"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1145\/2588555.2612181"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1137\/0201010"},{"key":"ref36","first-page":"1","article-title":"Measuring user influence in Twitter: The million follower fallacy","author":"cha","year":"2010","journal-title":"Proc of the Int Conf on Weblogs and Social Media (ICWSM)"},{"key":"ref35","first-page":"511","article-title":"Reachability queries in very large graphs: A fast refined online search approach","author":"veloso","year":"2014","journal-title":"Proc Int Conf on Extending Database Technology (EDBT)"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1109\/ICDE.2013.6544893"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/PARBSE.1990.77136"},{"key":"ref11","first-page":"301","article-title":"A reduct-and-closure algorithm for graphs","author":"goralcikov\u00e1","year":"1979","journal-title":"Proc Int l Symp Mathematical Foundations of Computer Science"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1145\/3035918.3035927"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1007\/s00778-018-0495-8"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1093\/comnet\/cnu039"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/WI.2005.152"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1093\/bioinformatics\/btq342"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1613\/jair.3118"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1186\/1752-0509-7-73"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1186\/1471-2105-13-281","article-title":"Efficient reconstruction of biological networks via transitive reduction on general purpose graphics processors","volume":"13","author":"bo\u0161na?ki","year":"2012","journal-title":"BMC Bioinf"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.14778\/2556549.2556578"},{"key":"ref4","first-page":"245","article-title":"Finding a minimal transitive reduction in a strongly connected digraph within linear time","author":"simon","year":"1989","journal-title":"Proc 15th Int Workshop Graph-Theoretic Concepts Comput Sci (WG)"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1145\/2463676.2465286"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1016\/0304-3975(88)90032-1"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1007\/978-3-642-03367-4_7"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1145\/2505515.2505724"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1016\/0012-365X(93)90164-O"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1016\/0167-6423(89)90039-7"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1145\/2213977.2214056"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1137\/0211023"},{"key":"ref9","first-page":"106","article-title":"Maintenance of transitive closures and transitive reductions of graphs","author":"poutr\u00e9","year":"1987","journal-title":"Proc Int Workshop Graph-Theoretic Concepts Comput Sci (WG)"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1137\/0201008"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1016\/j.joi.2014.07.006"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1145\/2213836.2213856"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1016\/j.ins.2015.02.033"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1016\/S0747-7171(08)80013-2"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1145\/2213836.2213855"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/TKDE.2016.2631160"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1007\/s00778-017-0468-3"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09006804.pdf?arnumber=9006804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:57:18Z","timestamp":1642003038000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9006804\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2975650","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}