{"id":"https://openalex.org/W3007436284","doi":"https://doi.org/10.1137/1.9781611976830.13","title":"Parallel Clique Counting and Peeling Algorithms","display_name":"Parallel Clique Counting and Peeling Algorithms","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3007436284","doi":"https://doi.org/10.1137/1.9781611976830.13","mag":"3007436284"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611976830.13","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611976830.13","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21)","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039516597","display_name":"Jessica Shi","orcid":"https://orcid.org/0000-0003-4485-5492"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jessica Shi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065818820","display_name":"Laxman Dhulipala","orcid":"https://orcid.org/0000-0003-0685-064X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Laxman Dhulipala","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5051583907","display_name":"Julian Shun","orcid":"https://orcid.org/0000-0001-6163-6625"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Julian Shun","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5039516597"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.5811,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.9894785,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"135","last_page":"146"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9991999864578247,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/clique","display_name":"Clique","score":0.7629970908164978},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6932811141014099},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.650901198387146},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5691455602645874},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4554053246974945},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45074066519737244},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4435368776321411},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.4370640516281128},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.4280531406402588},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4230920672416687},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3851962387561798},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.29669106006622314},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.11524620652198792},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07739308476448059}],"concepts":[{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.7629970908164978},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6932811141014099},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.650901198387146},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5691455602645874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4554053246974945},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45074066519737244},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4435368776321411},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.4370640516281128},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.4280531406402588},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4230920672416687},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3851962387561798},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.29669106006622314},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.11524620652198792},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07739308476448059},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611976830.13","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611976830.13","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21)","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":64,"referenced_works":["https://openalex.org/W104109059","https://openalex.org/W1475732121","https://openalex.org/W1543897857","https://openalex.org/W1567562836","https://openalex.org/W1582397847","https://openalex.org/W1889221628","https://openalex.org/W1967066104","https://openalex.org/W1970267553","https://openalex.org/W1972978715","https://openalex.org/W1973346610","https://openalex.org/W1994727615","https://openalex.org/W2001430189","https://openalex.org/W2002205566","https://openalex.org/W2009122662","https://openalex.org/W2022155283","https://openalex.org/W2022841964","https://openalex.org/W2023518480","https://openalex.org/W2042706982","https://openalex.org/W2051109346","https://openalex.org/W2055245094","https://openalex.org/W2074757518","https://openalex.org/W2094224753","https://openalex.org/W2120490947","https://openalex.org/W2130566259","https://openalex.org/W2152993997","https://openalex.org/W2155978818","https://openalex.org/W2232813226","https://openalex.org/W2266714125","https://openalex.org/W2342372809","https://openalex.org/W2543598748","https://openalex.org/W2550802162","https://openalex.org/W2585003791","https://openalex.org/W2587302913","https://openalex.org/W2595815880","https://openalex.org/W2605850919","https://openalex.org/W2728241679","https://openalex.org/W2739409954","https://openalex.org/W2755088640","https://openalex.org/W2759633270","https://openalex.org/W2770225549","https://openalex.org/W2787993231","https://openalex.org/W2798643801","https://openalex.org/W2802109861","https://openalex.org/W2802440256","https://openalex.org/W2804080114","https://openalex.org/W2895492593","https://openalex.org/W2950655838","https://openalex.org/W2962752269","https://openalex.org/W2963066364","https://openalex.org/W2963467900","https://openalex.org/W2963673569","https://openalex.org/W2965179470","https://openalex.org/W2970204999","https://openalex.org/W2970629282","https://openalex.org/W2970828623","https://openalex.org/W2997302914","https://openalex.org/W3012979453","https://openalex.org/W3046691040","https://openalex.org/W3080669466","https://openalex.org/W3084844108","https://openalex.org/W3102137745","https://openalex.org/W3129908388","https://openalex.org/W3145128584","https://openalex.org/W3145595734"],"related_works":["https://openalex.org/W2165678151","https://openalex.org/W1796509207","https://openalex.org/W2082603400","https://openalex.org/W3203939381","https://openalex.org/W2140498717","https://openalex.org/W858234464","https://openalex.org/W4285171291","https://openalex.org/W2162082186","https://openalex.org/W2951533720","https://openalex.org/W3083429938"],"abstract_inverted_index":{"We":[0,50,191],"present":[1,40,52],"a":[2,85,93,115,139],"new":[3,41,53,70],"parallel":[4,54,71,152,166],"algorithm":[5,30,103],"for":[6,26,46,56,74,154,210],"k-clique":[7,77,155,158,167,182],"counting/listing":[8],"that":[9,112],"has":[10,98],"polylogarithmic":[11,99,107],"span":[12],"(parallel":[13],"time)":[14],"and":[15,43,87,97,129,149,157,176],"is":[16,31,84,92],"work-efficient":[17,72],"(matches":[18],"the":[19,22,76,80,88,121,127,164,196,200,211],"work":[20],"of":[21,60,82,90,181],"best":[23],"sequential":[24],"algorithm)":[25],"sparse":[27],"graphs.":[28],"Our":[29,101],"based":[32],"on":[33,199],"computing":[34,47],"low":[35],"out-degree":[36],"orientations,":[37],"which":[38,83,91],"we":[39,67,110,124,170,185],"linear-work":[42],"polylogarithmic-span":[44],"algorithms":[45,55,73,128,146],"in":[48],"parallel.":[49],"also":[51,125],"producing":[57],"unbiased":[58],"estimations":[59],"clique":[61],"counts":[62,198],"using":[63],"graph":[64,203],"sparsification.":[65],"Finally,":[66],"design":[68],"two":[69,206],"approximating":[75],"densest":[78,159,183],"subgraph,":[79,160,184],"first":[81,102,212],"1/k-approximation":[86],"second":[89],"1/(k(1":[94],"+":[95],"\u220a))-approximation":[96],"span.":[100],"does":[104],"not":[105],"have":[106],"span,":[108],"but":[109],"prove":[111],"it":[113],"solves":[114],"P-complete":[116],"problem.":[117],"In":[118],"addition":[119],"to":[120,133,163,173,178,188,194],"theoretical":[122],"results,":[123],"implement":[126],"propose":[130],"various":[131],"optimizations":[132],"improve":[134],"their":[135],"practical":[136],"performance.":[137],"On":[138],"30-core":[140],"machine":[141],"with":[142,204],"two-way":[143],"hyper-threading,":[144],"our":[145],"achieve":[147,171,186],"13.23\u201338.99x":[148],"1.19\u201313.76x":[150],"self-relative":[151],"speedup":[153],"counting":[156,168],"respectively.":[161],"Compared":[162],"state-of-the-art":[165],"algorithms,":[169],"up":[172,187],"9.88x":[174],"speedup,":[175],"compared":[177],"existing":[179],"implementations":[180],"11.83x":[189],"speedup.":[190],"are":[192],"able":[193],"compute":[195],"4-clique":[197],"largest":[201],"publicly-available":[202],"over":[205],"hundred":[207],"billion":[208],"edges":[209],"time.":[213]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}