{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T09:54:52Z","timestamp":1772790892301,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,13]],"date-time":"2015-06-13T00:00:00Z","timestamp":1434153600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"U.S. National Science Foundation","award":["CAREER Award Number 0953100"],"award-info":[{"award-number":["CAREER Award Number 0953100"]}]},{"name":"U.S. National Science Foundation","award":["Award Number 1339745"],"award-info":[{"award-number":["Award Number 1339745"]}]},{"name":"U.S. National Science Foundation","award":["Award Number 1337177"],"award-info":[{"award-number":["Award Number 1337177"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,13]]},"DOI":"10.1145\/2755573.2755580","type":"proceedings-article","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T18:43:54Z","timestamp":1434134634000},"page":"212-223","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Branch-Avoiding Graph Algorithms"],"prefix":"10.1145","author":[{"given":"Oded","family":"Green","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}]},{"given":"Marat","family":"Dukhan","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}]},{"given":"Richard","family":"Vuduc","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"GraphCT: A Graph Characterization Toolkit.  GraphCT: A Graph Characterization Toolkit."},{"key":"e_1_3_2_1_2_1","unstructured":"10th dimacs implementation challenge - graph partitioning and graph clustering 2013.  10th dimacs implementation challenge - graph partitioning and graph clustering 2013."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1038\/43601"},{"key":"e_1_3_2_1_4_1","volume-title":"STINGER: Spatio-Temporal Interaction Networks and Graphs (STING) Extensible Representation. Technical report","author":"Bader D. A.","year":"2009","unstructured":"D. A. Bader , J. Berry , A. Amos-Binks , D. Chavarr\u00eda-Miranda , C. Hastings , K. Madduri , and S. C. Poulos . STINGER: Spatio-Temporal Interaction Networks and Graphs (STING) Extensible Representation. Technical report , Georgia Institute of Technology , 2009 . D. A. Bader, J. Berry, A. Amos-Binks, D. Chavarr\u00eda-Miranda, C. Hastings, K. Madduri, and S. C. Poulos. STINGER: Spatio-Temporal Interaction Networks and Graphs (STING) Extensible Representation. Technical report, Georgia Institute of Technology, 2009."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2006.34"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161102"},{"key":"e_1_3_2_1_8_1","first-page":"1","volume-title":"Storage and Analysis (SC), 2012 International Conference for","author":"Beamer S.","year":"2012","unstructured":"S. Beamer , K. Asanovic , and D. Patterson . Direction-optimizing breadth-first search. In High Performance Computing, Networking , Storage and Analysis (SC), 2012 International Conference for , pages 1 -- 10 . IEEE, 2012 . S. Beamer, K. Asanovic, and D. Patterson. Direction-optimizing breadth-first search. In High Performance Computing, Networking, Storage and Analysis (SC), 2012 International Conference for, pages 1--10. IEEE, 2012."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2013.159"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00083-9"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063471"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342011403516"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2012.6402918"},{"key":"e_1_3_2_1_15_1","first-page":"1","volume-title":"Storage and Analysis (SC), 2012 International Conference for","author":"Checconi F.","year":"2012","unstructured":"F. Checconi , F. Petrini , J. Willcock , A. Lumsdaine , A. R. Choudhury , and Y. Sabharwal . Breaking the speed and scalability barriers for graph exploration on distributed-memory machines. In High Performance Computing, Networking , Storage and Analysis (SC), 2012 International Conference for , pages 1 -- 12 . IEEE, 2012 . F. Checconi, F. Petrini, J. Willcock, A. Lumsdaine, A. R. Choudhury, and Y. Sabharwal. Breaking the speed and scalability barriers for graph exploration on distributed-memory machines. In High Performance Computing, Networking, Storage and Analysis (SC), 2012 International Conference for, pages 1--12. IEEE, 2012."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.43"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.46"},{"key":"e_1_3_2_1_18_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . The MIT Press , New York , 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, New York, 2001."},{"key":"e_1_3_2_1_19_1","volume-title":"PyHPC","author":"Dukhan M.","year":"2013","unstructured":"M. Dukhan . PeachPy : A python framework for developing high-performance assembly kernels , PyHPC 2013 . M. Dukhan. PeachPy: A python framework for developing high-performance assembly kernels, PyHPC 2013."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/290940.290962"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.323"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2012.6408680"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316229"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"e_1_3_2_1_25_1","volume-title":"AMD and VIA CPUs. An optimization guide for assembly programmers and compiler makers","author":"Fog A.","year":"2013","unstructured":"A. Fog . The microarchitecture of Intel , AMD and VIA CPUs. An optimization guide for assembly programmers and compiler makers . Copenhagen University College of Engineering , 2013 . A. Fog. The microarchitecture of Intel, AMD and VIA CPUs. An optimization guide for assembly programmers and compiler makers. Copenhagen University College of Engineering, 2013."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2688283.2688288"},{"key":"e_1_3_2_1_28_1","volume-title":"Branch-avoiding graph algorithms. CoRR, abs\/1411.1460","author":"Green O.","year":"2014","unstructured":"O. Green , M. Dukhan , and R. W. Vuduc . Branch-avoiding graph algorithms. CoRR, abs\/1411.1460 , 2014 . O. Green, M. Dukhan, and R. W. Vuduc. Branch-avoiding graph algorithms. CoRR, abs\/1411.1460, 2014."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom-PASSAT.2012.37"},{"key":"e_1_3_2_1_30_1","volume-title":"The parallel BGL: A generic library for distributed graph computations. Parallel Object-Oriented Scientific Computing (POOSC), page 2","author":"Gregor D.","year":"2005","unstructured":"D. Gregor and A. Lumsdaine . The parallel BGL: A generic library for distributed graph computations. Parallel Object-Oriented Scientific Computing (POOSC), page 2 , 2005 . D. Gregor and A. Lumsdaine. The parallel BGL: A generic library for distributed graph computations. Parallel Object-Oriented Scientific Computing (POOSC), page 2, 2005."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2150976.2151013"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/362248.362272"},{"key":"e_1_3_2_1_33_1","volume-title":"Metis-unstructured graph partitioning and sparse matrix ordering system, version 2.0","author":"Karypis G.","year":"1995","unstructured":"G. Karypis and V. Kumar . Metis-unstructured graph partitioning and sparse matrix ordering system, version 2.0 . 1995 . G. Karypis and V. Kumar. Metis-unstructured graph partitioning and sparse matrix ordering system, version 2.0. 1995."},{"key":"e_1_3_2_1_34_1","first-page":"4","volume-title":"Microarchitecture, 1997. Proceedings., Thirtieth Annual IEEE\/ACM International Symposium on","author":"Lee C.-C.","year":"1997","unstructured":"C.-C. Lee , I.-C. Chen , and T. N. Mudge . The bi-mode branch predictor . In Microarchitecture, 1997. Proceedings., Thirtieth Annual IEEE\/ACM International Symposium on , pages 4 -- 13 . IEEE, 1997 . C.-C. Lee, I.-C. Chen, and T. N. Mudge. The bi-mode branch predictor. In Microarchitecture, 1997. Proceedings., Thirtieth Annual IEEE\/ACM International Symposium on, pages 4--13. IEEE, 1997."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1984.1658927"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_38_1","volume-title":"IEEE International Conference on High Performance Computing","author":"McColl R.","year":"2013","unstructured":"R. McColl , O. Green , and D. Bader . Parallel streaming connected components using \"parent-neighbor\" subgraphs . In IEEE International Conference on High Performance Computing , 2013 . R. McColl, O. Green, and D. Bader. Parallel streaming connected components using \"parent-neighbor\" subgraphs. In IEEE International Conference on High Performance Computing, 2013."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145832"},{"key":"e_1_3_2_1_40_1","volume-title":"Workshop on Duplicating, Deconstructing and Debunking","author":"Milenkovic M.","year":"2002","unstructured":"M. Milenkovic , A. Milenkovic , and J. Kulick . Demystifying intel branch predictors . In Workshop on Duplicating, Deconstructing and Debunking , 2002 . M. Milenkovic, A. Milenkovic, and J. Kulick. Demystifying intel branch predictors. In Workshop on Duplicating, Deconstructing and Debunking, 2002."},{"issue":"1","key":"e_1_3_2_1_41_1","first-page":"60","volume":"2","author":"Milgram S.","year":"1967","unstructured":"S. Milgram . The Small World Problem. Psychology Today , 2 ( 1 ): 60 -- 67 , 1967 . S. Milgram. The Small World Problem. Psychology Today, 2(1):60--67, 1967.","journal-title":"The Small World Problem. Psychology Today"},{"key":"e_1_3_2_1_42_1","volume-title":"Finding and evaluating community structure in networks. Physical review E, 69(2):026113","author":"Newman M.","year":"2004","unstructured":"M. Newman and M. Girvan . Finding and evaluating community structure in networks. Physical review E, 69(2):026113 , 2004 . M. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical review E, 69(2):026113, 2004."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31464-3_29"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289527"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322235"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90008-6"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/800052.801871"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/384286.264210"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321107"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/123465.123475"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/146628.139709"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.4"}],"event":{"name":"SPAA '15: 27th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Portland Oregon USA","acronym":"SPAA '15","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2755573.2755580","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2755573.2755580","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:17:05Z","timestamp":1750227425000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2755573.2755580"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,13]]},"references-count":54,"alternative-id":["10.1145\/2755573.2755580","10.1145\/2755573"],"URL":"https:\/\/doi.org\/10.1145\/2755573.2755580","relation":{},"subject":[],"published":{"date-parts":[[2015,6,13]]},"assertion":[{"value":"2015-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}