{"id":"https://openalex.org/W4399282313","doi":"https://doi.org/10.1145/3650200.3656607","title":"Differentiating Set Intersections in Maximal Clique Enumeration by Function and Subproblem Size","display_name":"Differentiating Set Intersections in Maximal Clique Enumeration by Function and Subproblem Size","publication_year":2024,"publication_date":"2024-05-30","ids":{"openalex":"https://openalex.org/W4399282313","doi":"https://doi.org/10.1145/3650200.3656607"},"language":"en","primary_location":{"id":"doi:10.1145/3650200.3656607","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3650200.3656607","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3650200.3656607","source":null,"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 38th ACM International Conference on Supercomputing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3650200.3656607","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086758775","display_name":"Hans Vandierendonck","orcid":"https://orcid.org/0000-0001-5868-9259"},"institutions":[{"id":"https://openalex.org/I126231945","display_name":"Queen's University Belfast","ror":"https://ror.org/00hswnk62","country_code":"GB","type":"education","lineage":["https://openalex.org/I126231945"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Hans Vandierendonck","raw_affiliation_strings":["School of Electronics, Electrical Engineering and Computer Science, Queen's University Belfast, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0001-5868-9259","affiliations":[{"raw_affiliation_string":"School of Electronics, Electrical Engineering and Computer Science, Queen's University Belfast, United Kingdom","institution_ids":["https://openalex.org/I126231945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5086758775"],"corresponding_institution_ids":["https://openalex.org/I126231945"],"apc_list":null,"apc_paid":null,"fwci":1.0371,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.77918285,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"150","last_page":"163"},"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.9976000189781189,"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.9976000189781189,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9972000122070312,"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"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9926999807357788,"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/enumeration","display_name":"Enumeration","score":0.7953293323516846},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7507383823394775},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.6648733615875244},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.6413295865058899},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.5578427314758301},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.5126428008079529},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5092483758926392},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5032994151115417},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5024151802062988},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48145145177841187},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.46234360337257385},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41434264183044434},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3889625072479248},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37168121337890625},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35116046667099},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.21691378951072693},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.1211390495300293}],"concepts":[{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.7953293323516846},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7507383823394775},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6648733615875244},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6413295865058899},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.5578427314758301},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.5126428008079529},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5092483758926392},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5032994151115417},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5024151802062988},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48145145177841187},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.46234360337257385},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41434264183044434},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3889625072479248},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37168121337890625},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35116046667099},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.21691378951072693},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.1211390495300293},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3650200.3656607","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3650200.3656607","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3650200.3656607","source":null,"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 38th ACM International Conference on Supercomputing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.qub.ac.uk/portal:publications/020d4c46-d807-4fbc-a2b5-eba19b91adb0","is_oa":true,"landing_page_url":"https://pure.qub.ac.uk/en/publications/020d4c46-d807-4fbc-a2b5-eba19b91adb0","pdf_url":null,"source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Vandierendonck , H 2024 , Differentiating set intersections in maximal clique enumeration by function and subproblem size . in ICS '24: Proceedings of the 38th ACM International Conference on Supercomputing . Proceedings of the 38th ACM International Conference on Supercomputing , Association for Computing Machinery , pp. 150 - 163 , ACM International Conference on Supercomputing 2024 , Kyoto , Japan , 04/06/2024 . https://doi.org/10.1145/3650200.3656607","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.1145/3650200.3656607","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3650200.3656607","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3650200.3656607","source":null,"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 38th ACM International Conference on Supercomputing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2281476521","display_name":null,"funder_award_id":"EP/T022175","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G2387566524","display_name":"Kelvin-2","funder_award_id":"EP/T022175/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6227189603","display_name":null,"funder_award_id":"EP/X01794X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7088920316","display_name":"Asynchronous Scientific Continuous Computations Exploiting Disaggregation (ASCCED)","funder_award_id":"EP/X01794X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399282313.pdf"},"referenced_works_count":48,"referenced_works":["https://openalex.org/W125841639","https://openalex.org/W131619556","https://openalex.org/W259338706","https://openalex.org/W1530803355","https://openalex.org/W1567562836","https://openalex.org/W1968537206","https://openalex.org/W1969335781","https://openalex.org/W1993524210","https://openalex.org/W2008377642","https://openalex.org/W2028902195","https://openalex.org/W2068617151","https://openalex.org/W2101323562","https://openalex.org/W2115022330","https://openalex.org/W2116007667","https://openalex.org/W2123479816","https://openalex.org/W2131804386","https://openalex.org/W2160429376","https://openalex.org/W2165606466","https://openalex.org/W2173213060","https://openalex.org/W2180361393","https://openalex.org/W2249320699","https://openalex.org/W2283004062","https://openalex.org/W2317565191","https://openalex.org/W2483160837","https://openalex.org/W2613264175","https://openalex.org/W2739409954","https://openalex.org/W2775591332","https://openalex.org/W2780870264","https://openalex.org/W2946862025","https://openalex.org/W2949366051","https://openalex.org/W2952145918","https://openalex.org/W2997302914","https://openalex.org/W3008522202","https://openalex.org/W3011351775","https://openalex.org/W3035434998","https://openalex.org/W3084947387","https://openalex.org/W3102523054","https://openalex.org/W3123542955","https://openalex.org/W3125773275","https://openalex.org/W3136926519","https://openalex.org/W3170379488","https://openalex.org/W3197484625","https://openalex.org/W3206117777","https://openalex.org/W4282981834","https://openalex.org/W4287685525","https://openalex.org/W4386125394","https://openalex.org/W6959643953","https://openalex.org/W7139033639"],"related_works":["https://openalex.org/W3121666834","https://openalex.org/W2951533720","https://openalex.org/W2794565019","https://openalex.org/W2891037262","https://openalex.org/W4300229885","https://openalex.org/W1487885374","https://openalex.org/W2162082186","https://openalex.org/W4285171291","https://openalex.org/W1560842054","https://openalex.org/W4224326468"],"abstract_inverted_index":{"Clique":[0],"finding":[1],"problems":[2],"such":[3],"as":[4],"maximal":[5,131],"clique":[6,118,132],"enumeration":[7],"are":[8],"computationally":[9],"challenging":[10,179],"due":[11],"to":[12,21,48,58,64,72,128],"the":[13,27,40,43,60,68,82,85,129],"combinatorial":[14],"number":[15],"of":[16,29,42,84,87,117,152,167],"vertex":[17],"sets":[18],"that":[19,103],"need":[20],"be":[22],"evaluated.":[23],"Despite":[24],"prior":[25],"advances,":[26],"majority":[28],"execution":[30],"time":[31],"is":[32,150],"still":[33],"spent":[34],"in":[35],"set":[36,61],"intersections,":[37],"which":[38,80],"limits":[39],"speed":[41],"algorithms":[44,134],"and":[45,67,112,120,124,141,155,163,170],"their":[46],"application":[47],"increasingly":[49],"larger":[50],"graphs.":[51],"To":[52],"address":[53],"this":[54],"issue,":[55],"we":[56],"propose":[57],"differentiate":[59],"intersection":[62,89,107,121],"algorithm":[63],"its":[65],"function":[66],"problem":[69],"size,":[70],"leading":[71],"several":[73],"innovations:":[74],"(i)":[75],"a":[76,95,99,147,164],"new":[77,100],"primitive":[78],"\u201cintersect-size-exceeds\u201d":[79],"short-cuts":[81],"calculation":[83],"size":[86],"an":[88],"if":[90],"it":[91],"does":[92],"not":[93],"exceed":[94],"pre-determined":[96],"threshold;":[97],"(ii)":[98],"data":[101],"structure":[102],"supports":[104],"efficient":[105,114],"hash-based":[106],"on":[108,158,173],"constantly":[109],"evolving":[110],"sets;":[111],"(iii)":[113],"specialized":[115],"variants":[116],"search":[119,133],"for":[122],"\u201csmall\u201d":[123],"\u201ctiny\u201d":[125],"subproblems.":[126],"Compared":[127],"state-of-the-art":[130],"by":[135],"Blanusa":[136],"et":[137,143],"al":[138,144],"(VLDB":[139],"2020)":[140],"Besta":[142],"(MICRO":[145],"2021),":[146],"median":[148,165],"speedup":[149,166],"observed":[151],"4.14":[153],"\u00d7":[154,157,169,172],"10.91":[156],"AMD":[159],"Zen":[160],"Version":[161],"2,":[162],"3.44":[168],"8.26":[171],"Intel":[174],"Sapphire":[175],"Rapids":[176],"over":[177],"14":[178],"graph":[180],"datasets.":[181]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2025-12-26T23:08:49.675405","created_date":"2025-10-10T00:00:00"}