{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T10:08:29Z","timestamp":1759226909789,"version":"3.40.4"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075174"},{"type":"electronic","value":"9783319075181"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07518-1_23","type":"book-chapter","created":{"date-parts":[[2014,6,3]],"date-time":"2014-06-03T06:54:08Z","timestamp":1401778448000},"page":"365-381","source":"Crossref","is-referenced-by-count":17,"title":["Fast and Energy-efficient Breadth-First Search on a Single NUMA System"],"prefix":"10.1007","author":[{"given":"Yuichiro","family":"Yasui","sequence":"first","affiliation":[]},{"given":"Katsuki","family":"Fujisawa","sequence":"additional","affiliation":[]},{"given":"Yukinori","family":"Sato","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM\u00a019(2), 248\u2013264 (1972)","journal-title":"Journal of the ACM"},{"key":"23_CR2","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"1990","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"issue":"2","key":"23_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U. Brandes","year":"2001","unstructured":"Brandes, U.: A Faster Algorithm for Betweenness Centrality. J. Math. Sociol.\u00a025(2), 163\u2013177 (2001)","journal-title":"J. Math. Sociol."},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Frasca, M., Madduri, K., Raghavan, P.: NUMA-Aware Graph Mining Techniques for Performance and Energy Efficiency. In: Proc. ACM\/IEEE Int. Conf. High Performance Computing, Networking, Storage and Analysis (SC 2012), pp. 1\u201311. IEEE Computer Society (2012)","DOI":"10.1109\/SC.2012.81"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M. Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA\u00a099, 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"4","key":"23_CR6","first-page":"259","volume":"54","author":"Y. Yasui","year":"2011","unstructured":"Yasui, Y., Fujisawa, K., Goto, K., Kamiyama, N., Takamatsu, M.: NETAL: High-performance Implementation of Network Analysis Library Considering Computer Memory Hierarchy. J. Oper. Res. Soc. Japan\u00a054(4), 259\u2013280 (2011)","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Fujisawa, K., Endo, T., Yasui, Y., Sato, H., Matsuzawa, N., Matsuoka, S., Waki, H.: Petascale General Solver for Semidefinite Programming Problems with Over Two Million Constraints. In: Proc. IEEE Int. Symp. Parallel and Distributed Processing (IPDPS 2014). IEEE Computer Society (2014)","DOI":"10.1109\/IPDPS.2014.121"},{"key":"23_CR8","unstructured":"Murphy, R.C., Wheeler, K.B., Barrett, B.W., Ang, J.A.: Introducing the Graph500. In: Cray User Group 2010 Proceedings (2010)"},{"key":"23_CR9","unstructured":"Hoefler, T.: GreenGraph500 Submission Rules, http:\/\/green.graph500.org\/greengraph500rules.pdf"},{"key":"23_CR10","first-page":"985","volume":"11","author":"J. Leskovec","year":"2010","unstructured":"Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C., Ghahramani, Z.: Kronecker Graphs: An Approach to Modeling Networks. J. Mach. Learning Res.\u00a011, 985\u20131042 (2010)","journal-title":"J. Mach. Learning Res."},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: A Recursive Model for Graph Mining. In: Proc. 4th SIAM Int. Conf. Data Mining, pp. 442\u2013446. SIAM (2004)","DOI":"10.1137\/1.9781611972740.43"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Madduri, K.: Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2. In: Proc. 2006 Int. Conf. Parallel Processing (ICPP 2006), pp. 523\u2013530. IEEE Computer Society (2006)","DOI":"10.1109\/ICPP.2006.34"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Agarwal, V., Petrini, F., Pasetto, D., Bader, D.A.: Scalable Graph Exploration on Multicore Processors. In: Proc. ACM\/IEEE Int. Conf. High Performance Computing, Networking, Storage and Analysis (SC 2010), pp. 1\u201311. IEEE Computer Society (2010)","DOI":"10.1109\/SC.2010.46"},{"key":"23_CR14","volume-title":"Searching for a Parent Instead of Fighting Over Children: A Fast Breadth-first Search Implementation for Graph500","author":"S. Beamer","year":"2011","unstructured":"Beamer, S., Asanovi\u0107, K., Patterson, D.A.: Searching for a Parent Instead of Fighting Over Children: A Fast Breadth-first Search Implementation for Graph500. EECS Department, University of California, UCB\/EECS-2011-117, Berkeley, CA (2011)"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Beamer, S., Asanovi\u0107, K., Patterson, D.A.: Direction-optimizing Breadth-first Search. In: Proc. ACM\/IEEE Int. Conf. High Performance Computing, Networking, Storage and Analysis (SC 2012), p. 12. IEEE Computer Society (2012)","DOI":"10.1109\/SC.2012.50"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Yasui, Y., Fujisawa, K., Goto, K.: NUMA-optimized Parallel Breadth-first Search on Multicore Single-node System. In: Proc. IEEE Int. Conf. BigData 2013. IEEE Computer Society (2013)","DOI":"10.1109\/BigData.2013.6691600"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Yoo, A., Chow, E., Henderson, K., McLendon, W., Hendrickson, B., Catalyurek, U.: A Scalable Distributed Parallel Breadth-first Search Algorithm on BlueGene\/L. In: Proc. ACM\/IEEE Conf. Supercomputing (SC 2005), p. 25. IEEE Computer Society (2005)","DOI":"10.1109\/SC.2005.4"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7, A., Madduri, K.: Parallel Breadth-first Search on Distributed Memory Systems. In: Proc. ACM\/IEEE Int. Conf. High Performance Computing, Networking, Storage and Analysis (SC11), p. 65. ACM (2011)","DOI":"10.1145\/2063384.2063471"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Petrini, F., Checconi, F., Willcock, J., Lumsdaine, A., Choudhury, A.R., Sabharval, Y.: Breaking the Speed and Scalability Barriers for Graph Exploration on Distributed-memory Machines. In: Proc. ACM\/IEEE Int. Conf. High Performance Computing, Networking, Storage and Analysis (SC 2012), p. 13. IEEE Computer Society (2012)","DOI":"10.1109\/SC.2012.25"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Ueno, K., Suzumura, T.: Highly Scalable Graph Search for the Graph500 Benchmark. In: Proc. 21st Int. ACM Symp. High-Performance Parallel and Distributed Computing (HPDC 2012), pp. 149\u2013160. ACM (2012)","DOI":"10.1145\/2287076.2287104"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Ueno, K., Suzumura, T.: Parallel Distributed Breadth First Search on GPU. In: Proc. IEEE Int. Conf. High Performance Computing (HiPC 2013). IEEE Computer Society (2013)","DOI":"10.1109\/HiPC.2013.6799136"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1007\/978-3-642-33765-9_59","volume-title":"Computer Vision \u2013 ECCV 2012","author":"J. McAuley","year":"2012","unstructured":"McAuley, J., Leskovec, J.: Image Labeling on a Network: Using Social-Network Metadata for Image Classification. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012, Part IV. LNCS, vol.\u00a07575, pp. 828\u2013841. Springer, Heidelberg (2012)"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed Networks in Social Media. In: CHI (2010)","DOI":"10.1145\/1753326.1753532"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., Kleinberg, J.: Predicting Positive and Negative Links in Online Social Networks. In: WWW (2010)","DOI":"10.1145\/1772690.1772756"},{"key":"23_CR25","unstructured":"The 9th DIMACS Implementation Challenge, http:\/\/www.dis.uniroma1.it\/~challenge9\/"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Backstrom, L., Huttenlocher, D., Kleinberg, J., Lan, X.: Group Formation in Large Social Networks: Membership, Growth, and Evolution. In: KDD (2006)","DOI":"10.1145\/1150402.1150412"},{"issue":"1","key":"23_CR27","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J. Leskovec","year":"2009","unstructured":"Leskovec, J., Lang, K., Dasgupta, A., Mahoney, M.: Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters. Internet Mathematics\u00a06(1), 29\u2013123 (2009)","journal-title":"Internet Mathematics"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Kwak, H., Lee, C., Park, H., Moon, S.: What is Twitter, a Social Network or a News Media? In: Proceedings of the 19th International Conference on World Wide Web (WWW 2010), pp. 591\u2013600 (2010)","DOI":"10.1145\/1772690.1772751"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec, J.: Defining and Evaluating Network Communities based on Ground-truth. In: ICDM (2012)","DOI":"10.1145\/2350190.2350193"}],"container-title":["Lecture Notes in Computer Science","Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07518-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:19:45Z","timestamp":1746253185000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-07518-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075174","9783319075181"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07518-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}