{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T09:32:51Z","timestamp":1787563971929,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,2,23]],"date-time":"2013-02-23T00:00:00Z","timestamp":1361577600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,2,23]]},"DOI":"10.1145\/2442516.2442530","type":"proceedings-article","created":{"date-parts":[[2013,2,26]],"date-time":"2013-02-26T10:23:04Z","timestamp":1361874184000},"page":"135-146","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":562,"title":["Ligra"],"prefix":"10.1145","author":[{"given":"Julian","family":"Shun","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guy E.","family":"Blelloch","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,2,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.46"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777879.1777889"},{"key":"e_1_3_2_1_4_1","volume-title":"SC","author":"Beamer S.","year":"2012","unstructured":"S. Beamer , K. Asanovi\u0107 , and D. Patterson . Direction-optimizing breadth-first search . In SC , 2012 . S. Beamer, K. Asanovi\u0107, and D. Patterson. Direction-optimizing breadth-first search. In SC, 2012."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370685"},{"key":"e_1_3_2_1_6_1","first-page":"25","author":"Brandes U.","year":"2001","unstructured":"U. Brandes . A faster algorithm for betweenness centrality. Journal of Mathematical Sociology , 25 , 2001 . U. Brandes. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25, 2001.","journal-title":"Journal of Mathematical Sociology"},{"key":"e_1_3_2_1_7_1","volume-title":"WWW","author":"Brin S.","year":"1998","unstructured":"S. Brin and L. Page . The anatomy of a large-scale hypertextual web search engine . In WWW , 1998 . S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. In WWW, 1998."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342011403516"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1534"},{"key":"e_1_3_2_1_11_1","volume-title":"Introduction to Algorithms (3. ed.)","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms (3. ed.) . MIT Press , 2009 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms (3. ed.). MIT Press, 2009."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5611-4_28"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2791204.2791213"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2008.45"},{"key":"e_1_3_2_1_16_1","unstructured":"Giraph. \"http:\/\/giraph.apache.org\" 2012.  Giraph. \"http:\/\/giraph.apache.org\" 2012."},{"key":"e_1_3_2_1_17_1","volume-title":"OSDI","author":"Gonzalez J.","year":"2012","unstructured":"J. Gonzalez , Y. Low , H. Gu , D. Bickson , and C. Guestrin . Power-Graph: Distributed graph-parallel computation on natural graphs . In OSDI , 2012 . J. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. Power-Graph: Distributed graph-parallel computation on natural graphs. In OSDI, 2012."},{"key":"e_1_3_2_1_18_1","unstructured":"Graph500. \"http:\/\/www.graph500.org\" 2012.  Graph500. \"http:\/\/www.graph500.org\" 2012."},{"key":"e_1_3_2_1_19_1","volume-title":"POOSC","author":"Gregor D.","year":"2005","unstructured":"D. Gregor and A. Lumsdaine . The Parallel BGL: A generic library for distributed graph computations . In POOSC , 2005 . D. Gregor and A. Lumsdaine. The Parallel BGL: A generic library for distributed graph computations. In POOSC, 2005."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2011.14"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2150976.2151013"},{"key":"e_1_3_2_1_22_1","unstructured":"J. Jaja. Introduction to Parallel Algorithms. Addison-Wesley Professional 1992.   J. Jaja. Introduction to Parallel Algorithms. Addison-Wesley Professional 1992."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921632.1921634"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-010-0305-0"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_1_26_1","volume-title":"OSDI","author":"Kyrola A.","year":"2012","unstructured":"A. Kyrola , G. Blelloch , and C. Guestrin . GraphChi: Large-scale graph computation on just a PC . In OSDI , 2012 . A. Kyrola, G. Blelloch, and C. Guestrin. GraphChi: Large-scale graph computation on just a PC. In OSDI, 2012."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-010-0405-3"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810534"},{"key":"e_1_3_2_1_29_1","volume-title":"Conference on Uncertainty in Artificial Intelligence","author":"Low Y.","year":"2010","unstructured":"Y. Low , J. Gonzalez , A. Kyrola , D. Bickson , C. Guestrin , and J. M. Hellerstein . GraphLab: A new parallel framework for machine learning . In Conference on Uncertainty in Artificial Intelligence , 2010 . Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. M. Hellerstein. GraphLab: A new parallel framework for machine learning. In Conference on Uncertainty in Artificial Intelligence, 2010."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.80"},{"key":"e_1_3_2_1_32_1","volume-title":"ALENEX","author":"Madduri K.","year":"2007","unstructured":"K. Madduri , D. A. Bader , J. W. Berry , and J. R. Crobak . An experimental study of a parallel shortest path algorithm for solving largescale graph instances . In ALENEX , 2007 . K. Madduri, D. A. Bader, J. W. Berry, and J. R. Crobak. An experimental study of a parallel shortest path algorithm for solving largescale graph instances. In ALENEX, 2007."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1412228.1455266"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145832"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775059"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993501"},{"key":"e_1_3_2_1_39_1","volume-title":"USENIX ATC","author":"Prabhakaran V.","year":"2012","unstructured":"V. Prabhakaran , M. Wu , X. Weng , F. McSherry , L. Zhou , and M. Haridasan . Managing large graphs on multi-cores with graph awareness . In USENIX ATC , 2012 . V. Prabhakaran, M.Wu, X.Weng, F. McSherry, L. Zhou, and M. Haridasan. Managing large graphs on multi-cores with graph awareness. In USENIX ATC, 2012."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312018"},{"key":"e_1_3_2_1_42_1","unstructured":"Yahoo! Altavista web page hyperlink connectivity graph 2012. \"http:\/\/webscope.sandbox.yahoo.com\/catalog.php?datatype=g\".  Yahoo! Altavista web page hyperlink connectivity graph 2012. \"http:\/\/webscope.sandbox.yahoo.com\/catalog.php?datatype=g\"."}],"event":{"name":"PPoPP '13: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"Shenzhen China","acronym":"PPoPP '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2442516.2442530","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2442516.2442530","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:06Z","timestamp":1750220346000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2442516.2442530"}},"subtitle":["a lightweight graph processing framework for shared memory"],"short-title":[],"issued":{"date-parts":[[2013,2,23]]},"references-count":40,"alternative-id":["10.1145\/2442516.2442530","10.1145\/2442516"],"URL":"https:\/\/doi.org\/10.1145\/2442516.2442530","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2517327.2442530","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,2,23]]},"assertion":[{"value":"2013-02-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}