{"id":"https://openalex.org/W2998830375","doi":"https://doi.org/10.1145/3332466.3374527","title":"Practical parallel hypergraph algorithms","display_name":"Practical parallel hypergraph algorithms","alternate_titles":[],"publication_year":2020,"publication_date":"2020-02-19","ids":{"openalex":"https://openalex.org/W2998830375","doi":"https://doi.org/10.1145/3332466.3374527","mag":"2998830375"},"language":"en","primary_location":{"id":"doi:10.1145/3332466.3374527","doi":"https://doi.org/10.1145/3332466.3374527","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3332466.3374527","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3332466.3374527","source":{"id":"https://openalex.org/S4306417578","display_name":"ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2998830375"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3332466.3374527","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051583907","display_name":"Julian Shun","orcid":"https://orcid.org/0000-0001-6163-6625","observed_orcids":["https://orcid.org/0000-0001-6163-6625"]},"institutions":[{"id":"https://openalex.org/I4405258931","display_name":"MIT Computer Science and Artificial Intelligence Laboratory","ror":"https://ror.org/01e85r662","country_code":"US","type":"facility","lineage":["https://openalex.org/I4405258931","https://openalex.org/I63966007"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Julian Shun","raw_affiliation_strings":["MIT CSAIL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT CSAIL","institution_ids":["https://openalex.org/I4405258931","https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051583907"],"corresponding_institution_ids":["https://openalex.org/I4405258931","https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":5.5538,"has_fulltext":true,"cited_by_count":63,"citation_normalized_percentile":{"value":0.97086801,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"232","last_page":"249"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.0,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parallel-graph-algorithms","display_name":"parallel graph algorithms","score":0.921999990940094},{"id":"https://openalex.org/keywords/betweenness-centrality","display_name":"betweenness centrality","score":0.9660000205039978},{"id":"https://openalex.org/keywords/maximal-independent-sets","display_name":"maximal independent sets","score":0.996999979019165},{"id":"https://openalex.org/keywords/k-core-decomposition","display_name":"k-core decomposition","score":0.996999979019165},{"id":"https://openalex.org/keywords/hypertrees","display_name":"hypertrees","score":0.9810000061988831},{"id":"https://openalex.org/keywords/hyperpaths","display_name":"hyperpaths","score":0.9909999966621399},{"id":"https://openalex.org/keywords/connected-components","display_name":"connected components","score":0.9929999709129333},{"id":"https://openalex.org/keywords/pagerank","display_name":"PageRank","score":0.9990000128746033},{"id":"https://openalex.org/keywords/single-source-shortest-path","display_name":"single-source shortest path","score":0.9729999899864197},{"id":"https://openalex.org/keywords/data-compression","display_name":"data compression","score":0.5690000057220459}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8462045192718506},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7875251770019531},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5567352175712585},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5552974343299866},{"id":"https://openalex.org/C117045392","wikidata":"https://www.wikidata.org/wiki/Q4899215","display_name":"Betweenness centrality","level":3,"score":0.5363677144050598},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5357332229614258},{"id":"https://openalex.org/C2779172887","wikidata":"https://www.wikidata.org/wiki/Q184316","display_name":"PageRank","level":2,"score":0.5281804800033569},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.5239574909210205},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.47639694809913635},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4348714053630829},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.42872172594070435},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4168583154678345},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.413418173789978},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4026210308074951},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.28257012367248535},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13536235690116882},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3332466.3374527","doi":"https://doi.org/10.1145/3332466.3374527","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3332466.3374527","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3332466.3374527","source":{"id":"https://openalex.org/S4306417578","display_name":"ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3332466.3374527","doi":"https://doi.org/10.1145/3332466.3374527","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3332466.3374527","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3332466.3374527","source":{"id":"https://openalex.org/S4306417578","display_name":"ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G2348622287","display_name":"PORTABLE PARALLEL ALGORITHMS AND FRAMEWORKS FOR EXASCALE GRAPH ANALYTICS","funder_award_id":"DESC0018947","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G433856850","display_name":null,"funder_award_id":"HR0011- 18-3-0007","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G4363747310","display_name":"CAREER: Parallel Algorithms and Frameworks for Graph and Hypergraph Processing","funder_award_id":"1845763","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8510928812","display_name":null,"funder_award_id":"DE-SC0018947","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320306087","display_name":"Semiconductor Research Corporation","ror":"https://ror.org/047z4n946"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2998830375.pdf","grobid_xml":"https://content.openalex.org/works/W2998830375.grobid-xml"},"referenced_works_count":81,"referenced_works":["https://openalex.org/W78077100","https://openalex.org/W131619556","https://openalex.org/W160678529","https://openalex.org/W1490332863","https://openalex.org/W1527104720","https://openalex.org/W1546862091","https://openalex.org/W1582510186","https://openalex.org/W1783256592","https://openalex.org/W1807501439","https://openalex.org/W1971937094","https://openalex.org/W1976287818","https://openalex.org/W1984418932","https://openalex.org/W2000041758","https://openalex.org/W2004350101","https://openalex.org/W2005390858","https://openalex.org/W2007470648","https://openalex.org/W2011482339","https://openalex.org/W2016559894","https://openalex.org/W2034102265","https://openalex.org/W2040475473","https://openalex.org/W2042088790","https://openalex.org/W2059946383","https://openalex.org/W2066636486","https://openalex.org/W2072556776","https://openalex.org/W2078174680","https://openalex.org/W2095163132","https://openalex.org/W2100061495","https://openalex.org/W2102026093","https://openalex.org/W2105405583","https://openalex.org/W2119407198","https://openalex.org/W2130566259","https://openalex.org/W2135063076","https://openalex.org/W2142184646","https://openalex.org/W2151690061","https://openalex.org/W2152395566","https://openalex.org/W2170616854","https://openalex.org/W2171707538","https://openalex.org/W2360680204","https://openalex.org/W2396990711","https://openalex.org/W2444127451","https://openalex.org/W2485865435","https://openalex.org/W2503522328","https://openalex.org/W2523378841","https://openalex.org/W2524623326","https://openalex.org/W2524699965","https://openalex.org/W2542459869","https://openalex.org/W2574229471","https://openalex.org/W2619040869","https://openalex.org/W2739409954","https://openalex.org/W2755088640","https://openalex.org/W2766910786","https://openalex.org/W2788443250","https://openalex.org/W2788981395","https://openalex.org/W2790789009","https://openalex.org/W2798525482","https://openalex.org/W2802440256","https://openalex.org/W2808934018","https://openalex.org/W2883156110","https://openalex.org/W2897644843","https://openalex.org/W2898231337","https://openalex.org/W2902953018","https://openalex.org/W2915012400","https://openalex.org/W2931294367","https://openalex.org/W2932907495","https://openalex.org/W2946810225","https://openalex.org/W2962865652","https://openalex.org/W2964010284","https://openalex.org/W3104921985","https://openalex.org/W3142035222","https://openalex.org/W3144611226","https://openalex.org/W4211173878","https://openalex.org/W4212939824","https://openalex.org/W4231356197","https://openalex.org/W4233093232","https://openalex.org/W4235810972","https://openalex.org/W4240285526","https://openalex.org/W4243214013","https://openalex.org/W4246988441","https://openalex.org/W4253426709","https://openalex.org/W4253696084","https://openalex.org/W4300437137"],"related_works":["https://openalex.org/W4289828018","https://openalex.org/W7042697830","https://openalex.org/W2802440256","https://openalex.org/W4387461247","https://openalex.org/W4376602517","https://openalex.org/W3093773346","https://openalex.org/W7095633191","https://openalex.org/W7098491616","https://openalex.org/W6908349265","https://openalex.org/W4392908001"],"abstract_inverted_index":{"While":[0],"there":[1,10],"has":[2,11],"been":[3,12],"significant":[4],"work":[5,16,76],"on":[6,17,108,125],"parallel":[7,28,59,136],"graph":[8,87,98],"processing,":[9,32],"very":[13],"surprisingly":[14],"little":[15],"high-performance":[18],"hypergraph":[19,31,146],"processing.":[20],"This":[21],"paper":[22],"presents":[23],"a":[24,126],"collection":[25],"of":[26,75,119],"efficient":[27,63],"algorithms":[29,34,60,70,133,143],"for":[30,35],"including":[33,100],"betweenness":[36],"centrality,":[37],"maximal":[38],"independent":[39],"set,":[40],"k-core":[41],"decomposition,":[42],"hypertrees,":[43],"hyperpaths,":[44],"connected":[45],"components,":[46],"PageRank,":[47],"and":[48,77,93,104,121,129,138],"single-source":[49],"shortest":[50],"paths.":[51],"For":[52],"these":[53],"problems,":[54],"we":[55,83],"either":[56],"provide":[57],"new":[58],"or":[61],"more":[62],"implementations":[64,95],"than":[65,142],"prior":[66],"work.":[67],"Furthermore,":[68],"our":[69,81,94,132],"are":[71,139],"theoretically-efficient":[72],"in":[73,144],"terms":[74],"depth.":[78],"To":[79],"implement":[80],"algorithms,":[82],"extend":[84],"the":[85,109],"Ligra":[86],"processing":[88,118,147],"framework":[89],"to":[90,116],"support":[91],"hypergraphs,":[92],"benefit":[96],"from":[97],"optimizations":[99],"switching":[101],"between":[102],"sparse":[103],"dense":[105],"traversals":[106],"based":[107],"frontier":[110],"size,":[111],"edge-aware":[112],"parallelization,":[113],"using":[114],"buckets":[115],"prioritize":[117],"vertices,":[120],"compression.":[122],"Our":[123],"experiments":[124],"72-core":[127],"machine":[128],"show":[130],"that":[131],"obtain":[134],"excellent":[135],"speedups,":[137],"significantly":[140],"faster":[141],"existing":[145],"frameworks.":[148]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2998830375","counts_by_year":[{"year":2026,"cited_by_count":13},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":3}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2020-01-23T00:00:00"}
