{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T23:01:07Z","timestamp":1746918067502,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030227463"},{"type":"electronic","value":"9783030227470"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-22747-0_2","type":"book-chapter","created":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T09:19:00Z","timestamp":1560935940000},"page":"16-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Parallel Strongly Connected Components Detection with Multi-partition on GPUs"],"prefix":"10.1007","author":[{"given":"Junteng","family":"Hou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shupeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangjun","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ge","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siyu","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binbin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"issue":"10","key":"2_CR1","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1109\/43.875347","volume":"19","author":"A Xie","year":"2000","unstructured":"Xie, A., Beerel, P.A.: Implicit enumeration of strongly connected components and an application to formal verification. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst. 19(10), 1225\u20131230 (2000)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst."},{"key":"2_CR2","unstructured":"Simona, O.: On distributed verification and verified distribution. Ph.D. dissertation, Center for Mathematics and Computer Science (CWI) (2004)"},{"issue":"4","key":"2_CR3","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(4), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"2_CR4","volume-title":"A Discipline of Programming","author":"EW Dijkstra","year":"1976","unstructured":"Dijkstra, E.W.: A Discipline of Programming, 1st edn. Prentice Hall, Englewood Cliffs (1976)","edition":"1"},{"key":"2_CR5","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"issue":"5","key":"2_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(85)90024-9","volume":"20","author":"JH Reif","year":"1985","unstructured":"Reif, J.H.: Depth-first search is inherently sequential. Inf. Process. Lett. 20(5), 229\u2013234 (1985)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1093\/logcom\/exp003","volume":"21","author":"J Barnat","year":"2011","unstructured":"Barnat, J., Chaloupka, J., Jaco, V.D.P.: Distributed algorithms for SCC decomposition. J. Logic Comput. 21(1), 23\u201344 (2011)","journal-title":"J. Logic Comput."},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Barnat, J., Bauch, P., Brim, L., Ceska, M.: Computing strongly connected components in parallel on CUDA. In: Sussman, A., Mueller, F., Beaumont, O., Kandemir, M.T., Nikolopoulos, D.(eds.) IPDPS 2011, pp. 544\u2013555. IEEE(2011). https:\/\/doi.org\/10.1109\/ipdps.2011.59","DOI":"10.1109\/ipdps.2011.59"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/3-540-45591-4_68","volume-title":"Parallel and Distributed Processing","author":"LK Fleischer","year":"2000","unstructured":"Fleischer, L.K., Hendrickson, B., P\u0131nar, A.: On identifying strongly connected components in parallel. In: Rolim, J. (ed.) IPDPS 2000. LNCS, vol. 1800, pp. 505\u2013511. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45591-4_68"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"McLendon III, W., Hendrickson, B., Plimpton, S.J., Rauchwerger, L.: Finding strongly connected components in parallel in particle transport sweeps. In: SPAA 2001, pp. 328\u2013329. ACM, Crete (2011). https:\/\/doi.org\/10.1145\/378580.378751","DOI":"10.1145\/378580.378751"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Hong, S., Rodia, N.C., Olukotun, K.: On fast parallel detection of strongly connected components (SCC) in small-world graphs. In: SC 2013, pp. 1\u201311. ACM, Denver (2013). https:\/\/doi.org\/10.1145\/2503210.2503246","DOI":"10.1145\/2503210.2503246"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Li, P., Chen, X, Shen, J., Fang, J., Tang, T., Yang, C.: High performance detection of strongly connected components in sparse graphs on GPUs. In: PMAM@PPoPP 2017, pp. 48\u201357. ACM, Texas (2017). https:\/\/doi.org\/10.1145\/3026937.3026941","DOI":"10.1145\/3026937.3026941"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Devshatwar, S., Amilkanthwar, M., Nasre, R.: GPU centric extensions for parallel strongly connected components computation. In: GPGPU@PPoPP 2016, pp. 2\u201311. ACM, Barcelona (2016). https:\/\/doi.org\/10.1145\/2884045.2884048","DOI":"10.1145\/2884045.2884048"},{"issue":"1","key":"2_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.sysarc.2013.10.014","volume":"60","author":"GH Li","year":"2014","unstructured":"Li, G.H., Zhu, Z., Cong, Z., Yang, F.M.: Efficient decomposition of strongly connected components on GPUs. J. Syst. Archit. 60(1), 1\u201310 (2014)","journal-title":"J. Syst. Archit."},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-319-58943-5_42","volume-title":"Euro-Par 2016: Parallel Processing Workshops","author":"S Aldegheri","year":"2017","unstructured":"Aldegheri, S., Barnat, J., Bombieri, N., Busato, F., \u010ce\u0161ka, M.: Parametric multi-step scheme for GPU-accelerated graph decomposition into strongly connected components. In: Desprez, F., et al. (eds.) Euro-Par 2016. LNCS, vol. 10104, pp. 519\u2013531. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58943-5_42"},{"key":"2_CR16","unstructured":"Madduri, K., Bader, D.A.: GTgraph: a suite of synthetic graph generators. https:\/\/github.com\/dhruvbird\/GTgraph. Accessed 15 Sept 2012"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: a recursive model for graph mining. In: SDM 2004, pp. 442\u2013446. Society for Industrial and Applied Mathematics, Orlando (2004). https:\/\/doi.org\/10.1137\/1.9781611972740.43","DOI":"10.1137\/1.9781611972740.43"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/11602569_48","volume-title":"High Performance Computing \u2013 HiPC 2005","author":"DA Bader","year":"2005","unstructured":"Bader, D.A., Madduri, K.: Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors. In: Bader, D.A., Parashar, M., Sridhar, V., Prasanna, V.K. (eds.) HiPC 2005. LNCS, vol. 3769, pp. 465\u2013476. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11602569_48"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Kumar, R., Novak, J., Tomkins, A.: Structure and evolution of online social networks. In: KDD 2006, pp. 611\u2013617. ACM, New York (2006). https:\/\/doi.org\/10.1145\/1150402.1150476","DOI":"10.1145\/1150402.1150476"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.procs.2013.05.194","volume":"60","author":"D Defour","year":"2013","unstructured":"Defour, D., Marin, M.: Regularity versus load-balancing on GPU for treefix computations. Procedia Comput. Sci. 60, 309\u2013318 (2013)","journal-title":"Procedia Comput. Sci."},{"issue":"8","key":"2_CR21","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1016\/j.jpdc.2005.03.007","volume":"65","author":"W McLendon III","year":"2005","unstructured":"McLendon III, W., Hendrickson, B., Plimpton, S.J., Rauchwerger, L.: Finding strongly connected components in distributed graphs. J. Parallel Distrib. Comput. (JPDC) 65(8), 901\u2013910 (2005)","journal-title":"J. Parallel Distrib. Comput. (JPDC)"},{"key":"2_CR22","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. Accessed Jun 2014"},{"key":"2_CR23","unstructured":"Koblenz network collection. http:\/\/konect.uni-koblenz.de\/. Accessed 25 Apr 2018"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22747-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T03:53:05Z","timestamp":1686109985000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22747-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030227463","9783030227470"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22747-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"8 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Faro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}