{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:14:12Z","timestamp":1730272452860,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1109\/iscas45731.2020.9181251","type":"proceedings-article","created":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T13:22:27Z","timestamp":1601385747000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["MG-Hybrid: A Strongly Connected Components Detection Algorithm using Multiple GPUs"],"prefix":"10.1109","author":[{"given":"Junteng","family":"Hou","sequence":"first","affiliation":[{"name":"Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China; School of Cyber Security, University of Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shupeng","family":"Wang","sequence":"additional","affiliation":[{"name":"Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangjun","family":"Wu","sequence":"additional","affiliation":[{"name":"Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bingnan","family":"Ma","sequence":"additional","affiliation":[{"name":"National Computer Network Emergency Response Technical Team\/Coordination Center of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengxiang","family":"Si","sequence":"additional","affiliation":[{"name":"National Computer Network Emergency Response Technical Team\/Coordination Center of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siyu","family":"Jia","sequence":"additional","affiliation":[{"name":"Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"ref11","first-page":"829","article-title":"Automatic discovery of subgoals in reinforcement learning using strongly connected components","author":"kazemitabar","year":"2008","journal-title":"International Conference on Neural Information Processing"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2013.10.014"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3026937.3026941"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.41"},{"article-title":"Gtgraph: A suite of synthetic graph generators","year":"2012","author":"madduri","key":"ref15"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1016\/j.jpdc.2005.03.007","article-title":"Finding strongly connected components in distributed graphs","volume":"65","author":"iii","year":"2005","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851145"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/43.875347"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3018743.3018756"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/43.573831"},{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"ref5"},{"key":"ref8","volume":"1","author":"dijkstra","year":"1976","journal-title":"A Discipline of Programming"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2884045.2884048"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.59"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503246"},{"key":"ref1","first-page":"519","article-title":"Parametric multi-step scheme for gpu-accelerated graph? decomposition into strongly connected components","author":"aldegheri","year":"2016","journal-title":"European Conference on Parallel Processing"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145855"}],"event":{"name":"2020 IEEE International Symposium on Circuits and Systems (ISCAS)","start":{"date-parts":[[2020,10,12]]},"location":"Seville, Spain","end":{"date-parts":[[2020,10,14]]}},"container-title":["2020 IEEE International Symposium on Circuits and Systems (ISCAS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9179985\/9180369\/09181251.pdf?arnumber=9181251","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,15]],"date-time":"2024-01-15T21:04:15Z","timestamp":1705352655000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9181251\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/iscas45731.2020.9181251","relation":{},"subject":[],"published":{"date-parts":[[2020,10]]}}}