{"id":"https://openalex.org/W4291972606","doi":"https://doi.org/10.1145/3556541","title":"Parallel Five-cycle Counting Algorithms","display_name":"Parallel Five-cycle Counting Algorithms","publication_year":2022,"publication_date":"2022-08-16","ids":{"openalex":"https://openalex.org/W4291972606","doi":"https://doi.org/10.1145/3556541"},"language":"en","primary_location":{"id":"doi:10.1145/3556541","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3556541","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3556541","source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3556541","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039516597","display_name":"Jessica Shi","orcid":"https://orcid.org/0000-0003-4485-5492"},"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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jessica Shi","raw_affiliation_strings":["MIT CSAIL, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0003-4485-5492","affiliations":[{"raw_affiliation_string":"MIT CSAIL, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4405258931"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027970829","display_name":"Louisa Ruixue Huang","orcid":"https://orcid.org/0000-0003-1951-1372"},"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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Louisa Ruixue Huang","raw_affiliation_strings":["MIT CSAIL, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0003-1951-1372","affiliations":[{"raw_affiliation_string":"MIT CSAIL, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4405258931"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051583907","display_name":"Julian Shun","orcid":"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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Julian Shun","raw_affiliation_strings":["MIT CSAIL, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0001-6163-6625","affiliations":[{"raw_affiliation_string":"MIT CSAIL, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4405258931"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4405258931"],"apc_list":null,"apc_paid":null,"fwci":0.2248,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.45847628,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"27","issue":null,"first_page":"1","last_page":"23"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7355676293373108},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7112546563148499},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6223864555358887},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.5213395357131958},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.504170298576355},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4753122925758362},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.41508060693740845},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4105370044708252},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31539425253868103}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7355676293373108},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7112546563148499},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6223864555358887},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.5213395357131958},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.504170298576355},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4753122925758362},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41508060693740845},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4105370044708252},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31539425253868103},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3556541","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3556541","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3556541","source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/146275","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/146275","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM","raw_type":"Article"}],"best_oa_location":{"id":"doi:10.1145/3556541","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3556541","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3556541","source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"sustainable_development_goals":[],"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/G3526151021","display_name":"Graduate Research Fellowship Program","funder_award_id":"1122374","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"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/G6191928423","display_name":null,"funder_award_id":"1122374","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"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/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4291972606.pdf","grobid_xml":"https://content.openalex.org/works/W4291972606.grobid-xml"},"referenced_works_count":45,"referenced_works":["https://openalex.org/W1475732121","https://openalex.org/W1493774699","https://openalex.org/W1567554065","https://openalex.org/W1889221628","https://openalex.org/W1967066104","https://openalex.org/W1973346610","https://openalex.org/W1974332999","https://openalex.org/W1976196182","https://openalex.org/W2002205566","https://openalex.org/W2002779084","https://openalex.org/W2010042187","https://openalex.org/W2016559894","https://openalex.org/W2022155283","https://openalex.org/W2023518480","https://openalex.org/W2052262538","https://openalex.org/W2055245094","https://openalex.org/W2060038721","https://openalex.org/W2074584493","https://openalex.org/W2074724691","https://openalex.org/W2089064856","https://openalex.org/W2094224753","https://openalex.org/W2112262143","https://openalex.org/W2130566259","https://openalex.org/W2135063076","https://openalex.org/W2145764405","https://openalex.org/W2146507303","https://openalex.org/W2152993997","https://openalex.org/W2153409685","https://openalex.org/W2157312249","https://openalex.org/W2317565191","https://openalex.org/W2543598748","https://openalex.org/W2588458088","https://openalex.org/W2739409954","https://openalex.org/W2770225549","https://openalex.org/W2802440256","https://openalex.org/W2889320527","https://openalex.org/W2906892655","https://openalex.org/W2963001918","https://openalex.org/W2963205199","https://openalex.org/W2963467900","https://openalex.org/W2963673569","https://openalex.org/W2965557726","https://openalex.org/W3007436284","https://openalex.org/W3034302216","https://openalex.org/W3099866104"],"related_works":["https://openalex.org/W2317245370","https://openalex.org/W4249323025","https://openalex.org/W198851386","https://openalex.org/W1980160788","https://openalex.org/W2030310580","https://openalex.org/W947442053","https://openalex.org/W2148915962","https://openalex.org/W4313433561","https://openalex.org/W2283866686","https://openalex.org/W2948365806"],"abstract_inverted_index":{"Counting":[0],"the":[1,15,41,45,54,69,105,114,118,151,197],"frequency":[2],"of":[3,18,47,62,68,108,139,150,168],"subgraphs":[4],"in":[5,44,117,120],"large":[6],"networks":[7,20],"is":[8,27,57,222],"a":[9,28,155,166,172,211],"classic":[10],"research":[11],"question":[12],"that":[13,85,179],"reveals":[14],"underlying":[16],"substructures":[17],"these":[19],"for":[21,32,135,210],"important":[22,59],"applications.":[23],"However,":[24],"subgraph":[25,33,64],"counting":[26,65,81],"challenging":[29],"problem,":[30],"even":[31],"sizes":[34],"as":[35,37],"small":[36],"five,":[38],"due":[39],"to":[40,72,126,159,204,217,224],"combinatorial":[42],"explosion":[43],"number":[46],"possible":[48],"occurrences.":[49],"This":[50],"article":[51],"focuses":[52],"on":[53,98,165],"five-cycle,":[55],"which":[56,103,121],"an":[58],"special":[60],"case":[61],"five-vertex":[63],"and":[66,83,90,111,113,153,195,221,238],"one":[67],"most":[70],"difficult":[71],"count":[73],"efficiently.":[74],"We":[75,145],"design":[76],"two":[77],"new":[78,132],"parallel":[79,133,183],"five-cycle":[80,140,226],"algorithms":[82,95,115,134,152],"prove":[84],"they":[86,122],"are":[87,96],"work":[88,156],"efficient":[89,106],"achieve":[91],"polylogarithmic":[92],"span.":[93],"Both":[94],"based":[97],"computing":[99],"low":[100],"out-degree":[101],"orientations,":[102],"enables":[104],"computation":[107],"directed":[109],"two-paths":[110],"three-paths,":[112],"differ":[116],"ways":[119],"use":[123],"this":[124],"orientation":[125],"eliminate":[127],"double-counting.":[128],"Additionally,":[129],"we":[130],"present":[131],"obtaining":[136],"unbiased":[137],"estimates":[138],"counts":[141,227],"using":[142,171],"graph":[143],"sparsification.":[144],"develop":[146],"fast":[147],"multicore":[148],"implementations":[149],"propose":[154],"scheduling":[157],"optimization":[158],"improve":[160],"their":[161],"performance.":[162],"Our":[163,206],"experiments":[164],"variety":[167],"real-world":[169],"graphs":[170],"36-core":[173],"machine":[174],"with":[175,235],"two-way":[176],"hyper-threading":[177],"show":[178],"our":[180,190,231],"best":[181,207,232],"exact":[182,233],"algorithm":[184,201],"achieves":[185,215],"10\u201346\u00d7":[186],"self-relative":[187,219],"speedup,":[188],"outperforms":[189,196],"serial":[191,200],"benchmarks":[192],"by":[193,202],"10\u201332\u00d7,":[194],"previous":[198],"state-of-the-art":[199],"up":[203,216],"818\u00d7.":[205],"approximate":[208,225],"algorithm,":[209,234],"reasonable":[212],"probability":[213],"parameter,":[214],"20\u00d7":[218],"speedup":[220],"able":[223],"9\u2013189\u00d7":[228],"faster":[229],"than":[230],"between":[236],"0.52%":[237],"11.77%":[239],"error.":[240]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}