{"id":"https://openalex.org/W2950303488","doi":"https://doi.org/10.1145/3292500.3330986","title":"Efficient Maximum Clique Computation over Large Sparse Graphs","display_name":"Efficient Maximum Clique Computation over Large Sparse Graphs","publication_year":2019,"publication_date":"2019-07-25","ids":{"openalex":"https://openalex.org/W2950303488","doi":"https://doi.org/10.1145/3292500.3330986","mag":"2950303488"},"language":"en","primary_location":{"id":"doi:10.1145/3292500.3330986","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3292500.3330986","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","raw_type":"proceedings-article"},"type":"article","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/A5037530341","display_name":"Lijun Chang","orcid":"https://orcid.org/0000-0002-6830-3900"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Lijun Chang","raw_affiliation_strings":["The University of Sydney, Sydney, Australia"],"affiliations":[{"raw_affiliation_string":"The University of Sydney, Sydney, Australia","institution_ids":["https://openalex.org/I129604602"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037530341"],"corresponding_institution_ids":["https://openalex.org/I129604602"],"apc_list":null,"apc_paid":null,"fwci":8.423,"has_fulltext":false,"cited_by_count":81,"citation_normalized_percentile":{"value":0.98016284,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"529","last_page":"538"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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/T10142","display_name":"Formal Methods in Verification","score":0.991599977016449,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.7252911925315857},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6845043897628784},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.672997772693634},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5932059288024902},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.5912125706672668},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.4387741684913635},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.41470277309417725},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38512665033340454},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3493042588233948},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2634994685649872},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24759674072265625},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20330730080604553},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.12004882097244263},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09535238146781921}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.7252911925315857},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6845043897628784},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.672997772693634},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5932059288024902},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.5912125706672668},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.4387741684913635},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.41470277309417725},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38512665033340454},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3493042588233948},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2634994685649872},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24759674072265625},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20330730080604553},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.12004882097244263},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09535238146781921},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3292500.3330986","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3292500.3330986","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1442132175","https://openalex.org/W1485742133","https://openalex.org/W1556024794","https://openalex.org/W1594785451","https://openalex.org/W1594951361","https://openalex.org/W1823437338","https://openalex.org/W1970187347","https://openalex.org/W1983402337","https://openalex.org/W2026320281","https://openalex.org/W2055245094","https://openalex.org/W2070722739","https://openalex.org/W2081254453","https://openalex.org/W2082603400","https://openalex.org/W2156206152","https://openalex.org/W2160429376","https://openalex.org/W2401610261","https://openalex.org/W2423807589","https://openalex.org/W2588222785","https://openalex.org/W2589796617","https://openalex.org/W2612032746","https://openalex.org/W2719042323","https://openalex.org/W2750598393","https://openalex.org/W2757008478","https://openalex.org/W2906265678","https://openalex.org/W4251396722"],"related_works":["https://openalex.org/W2165678151","https://openalex.org/W2563006681","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"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2,137],"the":[3,19,48,80,87,105,144],"problem":[4],"of":[5,64,68,112,148],"MCC-Sparse,":[6],"Maximum":[7],"Clique":[8],"Computation":[9],"over":[10,71],"large":[11,139],"real-world":[12],"graphs":[13,141],"that":[14,38,75],"are":[15,39],"usually":[16],"Sparse.":[17],"In":[18,52,115],"literature,":[20],"MCC-Sparse":[21,50,65],"has":[22],"been":[23,45],"studied":[24],"separately":[25],"and":[26,34,103,109,142,146],"less":[27],"extensively":[28],"than":[29],"its":[30],"dense":[31,72],"counterpart":[32],"MCC-Dense,":[33],"advanced":[35,107],"algorithmic":[36],"techniques":[37,102,111],"developed":[40],"for":[41,96,124],"MCC-Dense":[42,82,113],"have":[43],"not":[44],"utilized":[46],"in":[47,130],"existing":[49,81,106],"solvers.":[51,83,114],"this":[53],"paper,":[54],"we":[55,89,117],"design":[56,119],"an":[57,62,120],"algorithm":[58,122],"MC-BRB":[59],"which":[60],"transforms":[61],"instance":[63],"to":[66],"instances":[67],"k-clique":[69],"finding":[70],"subgraphs":[73],"(KCF-Dense)":[74],"can":[76],"be":[77],"computed":[78],"by":[79,98],"To":[84],"further":[85],"improve":[86],"efficiency,":[88],"then":[90],"develop":[91],"a":[92,127],"new":[93],"branch-reduce-&-bound":[94],"framework":[95],"KCF-Dense":[97],"proposing":[99],"light-weight":[100],"reducing":[101],"leveraging":[104],"branching":[108],"bounding":[110],"addition,":[116],"also":[118],"ego-centric":[121],"MC-EGO":[123],"heuristically":[125],"computing":[126],"near-maximum":[128],"clique":[129],"near-linear":[131],"time.":[132],"We":[133],"conduct":[134],"extensive":[135],"empirical":[136],"on":[138],"real":[140],"demonstrate":[143],"efficiency":[145],"effectiveness":[147],"our":[149],"techniques.":[150]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":16},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":3}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2025-10-10T00:00:00"}