{"id":"https://openalex.org/W75795297","doi":"https://doi.org/10.1145/2567948.2577283","title":"Fast maximum clique algorithms for large graphs","display_name":"Fast maximum clique algorithms for large graphs","publication_year":2014,"publication_date":"2014-04-07","ids":{"openalex":"https://openalex.org/W75795297","doi":"https://doi.org/10.1145/2567948.2577283","mag":"75795297"},"language":"en","primary_location":{"id":"doi:10.1145/2567948.2577283","doi":"https://doi.org/10.1145/2567948.2577283","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2567948.2577283","pdf_url":null,"source":{"id":"https://openalex.org/S7407088480","display_name":"International World Wide Web Conference (WWW)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd International Conference on World Wide Web","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","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/A5009957887","display_name":"Ryan A. Rossi","orcid":"https://orcid.org/0000-0001-9758-0635","observed_orcids":["https://orcid.org/0000-0001-9758-0635"]},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ryan A. Rossi","raw_affiliation_strings":["Purdue University, West Lafayette, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084102378","display_name":"David F. Gleich","orcid":"https://orcid.org/0000-0002-8107-6474","observed_orcids":["https://orcid.org/0000-0002-8107-6474"]},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David F. Gleich","raw_affiliation_strings":["Purdue University, West Lafayette, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049685547","display_name":"Assefaw Hadish Gebremedhin","orcid":"https://orcid.org/0000-0001-5383-8032","observed_orcids":["https://orcid.org/0000-0001-5383-8032"]},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Assefaw H. Gebremedhin","raw_affiliation_strings":["Purdue University, West Lafayette, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041039212","display_name":"Md. Mostofa Ali Patwary","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Md. Mostofa Ali Patwary","raw_affiliation_strings":["Northwestern University, Evanston, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northwestern University, Evanston, IL, USA","institution_ids":["https://openalex.org/I111979921"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.1771,"has_fulltext":false,"cited_by_count":105,"citation_normalized_percentile":{"value":0.97941495,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"365","last_page":"366"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.926800012588501,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.926800012588501,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.03420000150799751,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.03290000185370445,"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/maximum-clique-problem","display_name":"maximum clique problem","score":0.9430000185966492},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.746999979019165},{"id":"https://openalex.org/keywords/sparse-graphs","display_name":"sparse graphs","score":0.9100000262260437},{"id":"https://openalex.org/keywords/social-networks","display_name":"social networks","score":0.921999990940094},{"id":"https://openalex.org/keywords/information-networks","display_name":"information networks","score":0.9649999737739563},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.8289999961853027},{"id":"https://openalex.org/keywords/pruning","display_name":"pruning","score":0.7519999742507935},{"id":"https://openalex.org/keywords/large-graphs","display_name":"large-scale graphs","score":0.5270000100135803}],"concepts":[{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6627222299575806},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6369787454605103},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6284009218215942},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.5989274382591248},{"id":"https://openalex.org/C128243737","wikidata":"https://www.wikidata.org/wiki/Q5134414","display_name":"Clique percolation method","level":3,"score":0.5160462856292725},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5102550983428955},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5037981867790222},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.499072790145874},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4887387752532959},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4437134265899658},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.4163703918457031},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3137264549732208},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24828243255615234},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17218813300132751},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13296708464622498},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.13185513019561768},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09855467081069946},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.09666088223457336},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","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/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2567948.2577283","doi":"https://doi.org/10.1145/2567948.2577283","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2567948.2577283","pdf_url":null,"source":{"id":"https://openalex.org/S7407088480","display_name":"International World Wide Web Conference (WWW)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd International Conference on World Wide Web","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1518080829","https://openalex.org/W1849256610","https://openalex.org/W1924572098","https://openalex.org/W1985718595","https://openalex.org/W2046112356","https://openalex.org/W2082195599","https://openalex.org/W2082603400","https://openalex.org/W2156206152","https://openalex.org/W2166742555"],"related_works":["https://openalex.org/W1499240152","https://openalex.org/W1924572098","https://openalex.org/W1823437338","https://openalex.org/W7095543869","https://openalex.org/W2529445031","https://openalex.org/W1594951361","https://openalex.org/W1849256610","https://openalex.org/W2291939239","https://openalex.org/W7097893164","https://openalex.org/W1745624931"],"abstract_inverted_index":{"We":[0,103],"propose":[1],"a":[2,52,55,86,91],"fast,":[3],"parallel":[4],"maximum":[5],"clique":[6,67,88],"algorithm":[7,63,78,106],"for":[8],"large":[9,87],"sparse":[10],"graphs":[11],"that":[12,84],"is":[13],"designed":[14],"to":[15,47,73,107],"exploit":[16],"characteristics":[17],"of":[18,76,114],"social":[19,56],"and":[20,90,94,100],"information":[21],"networks.":[22,117],"Despite":[23],"clique's":[24],"status":[25],"as":[26],"an":[27,80],"NP-hard":[28],"problem":[29],"with":[30,58,97],"poor":[31],"approximation":[32],"guarantees,":[33],"our":[34,77],"method":[35],"exhibits":[36],"nearly":[37],"linear":[38],"runtime":[39],"scaling":[40],"over":[41],"real-world":[42],"networks":[43],"ranging":[44],"from":[45],"1000":[46],"100":[48],"million":[49],"nodes.":[50],"In":[51],"test":[53],"on":[54],"network":[57],"1.8":[59],"billion":[60],"edges,":[61],"the":[62,65,74,105,109],"finds":[64,85],"largest":[66,110],"in":[68],"about":[69],"20":[70],"minutes.":[71],"Key":[72],"efficiency":[75],"are":[79],"initial":[81],"heuristic":[82],"procedure":[83],"quickly":[89],"parallelized":[92],"branch":[93],"bound":[95],"strategy":[96],"aggressive":[98],"pruning":[99],"ordering":[101],"techniques.":[102],"use":[104],"compute":[108],"temporal":[111,115],"strong":[112],"components":[113],"contact":[116]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}