{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:02:19Z","timestamp":1786978939921,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319038889","type":"print"},{"value":"9783319038896","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03889-6_5","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T01:27:22Z","timestamp":1386552442000},"page":"40-50","source":"Crossref","is-referenced-by-count":14,"title":["Efficient Hybrid Breadth-First Search on GPUs"],"prefix":"10.1007","author":[{"given":"Takaaki","family":"Hiragushi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daisuke","family":"Takahashi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Brief Introduction of Graph 500, \n                    \n                      http:\/\/www.graph500.org\/"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Beamer, S., Asanovi\u0107, K., Patterson, D.: Direction-Optimizing Breadth-First Search. In: Proc. International Conference on High Performance Computing, Networking, Storage and Analysis, SC 2012, No.\u00a012 (2012)","DOI":"10.1109\/SC.2012.50"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Agarwal, V., Petrini, F., Pasetto, D., Bader, D.A.: Scalable Graph Exploration on Multicore Processors. In: Proc. 2010 ACM\/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2010, pp. 1\u201311 (2010)","DOI":"10.1109\/SC.2010.46"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Beamer, S., Bulu\u00e7, A., Asanovi\u0107, K., Patterson, D.A.: Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search. Technical Report UCB\/EECS-2013-2, EECS Department, University of California, Berkeley (2013)","DOI":"10.1109\/IPDPSW.2013.159"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Merrill, D., Garland, M., Grimshaw, A.: Scalable GPU graph traversal. In: Proc. 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2012), pp. 117\u2013128 (2012)","DOI":"10.1145\/2145816.2145832"},{"key":"5_CR6","unstructured":"GTgraph: A suite of synthetic random graph generators, \n                    \n                      http:\/\/www.cse.psu.edu\/~madduri\/software\/GTgraph\/"},{"key":"5_CR7","unstructured":"The University of Florida Sparse Matrix Collection, \n                    \n                      http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/"},{"key":"5_CR8","unstructured":"Stanford Large Network Dataset Collection, \n                    \n                      http:\/\/snap.stanford.edu\/data\/"},{"key":"5_CR9","unstructured":"10th DIMACS Implementation Challenge, \n                    \n                      http:\/\/www.cc.gatech.edu\/dimacs10\/"},{"key":"5_CR10","unstructured":"back40computing - Fast and efficient software primitives for GPU computing - Google Project Hosting, \n                    \n                      http:\/\/code.google.com\/p\/back40computing\/"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-77220-0_21","volume-title":"High Performance Computing \u2013 HiPC 2007","author":"P. Harish","year":"2007","unstructured":"Harish, P., Narayanan, P.J.: Accelerating Large Graph Algorithms on the GPU Using CUDA. In: Aluru, S., Parashar, M., Badrinath, R., Prasanna, V.K. (eds.) HiPC 2007. LNCS, vol.\u00a04873, pp. 197\u2013208. Springer, Heidelberg (2007)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Satish, N., Kim, C., Chhugani, J., Dubey, P.: Large-Scale Energy-Efficient Graph Traversal: A Path to Efficient Data-Intensive Supercomputing. In: Proc. International Conference on High Performance Computing, Networking, Storage and Analysis, SC 2012, No.\u00a014 (2012)","DOI":"10.1109\/SC.2012.70"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Bernaschi, M., Bisson, M., Mastrostefano, E., Rossetti, D.: Breadth first search on APEnet+. In: Proc. 2012 SC Companion: High Performance Computing, Networking Storage and Analysis (SCC 2012), pp. 248\u2013253 (2012)","DOI":"10.1109\/SC.Companion.2012.41"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03889-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T04:49:33Z","timestamp":1558759773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03889-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038889","9783319038896"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03889-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}