{"id":"https://openalex.org/W1823437338","doi":"https://doi.org/10.1137/14100018x","title":"Parallel Maximum Clique Algorithms with Applications to Network Analysis","display_name":"Parallel Maximum Clique Algorithms with Applications to Network Analysis","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1823437338","doi":"https://doi.org/10.1137/14100018x","mag":"1823437338"},"language":"en","primary_location":{"id":"doi:10.1137/14100018x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/14100018x","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-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/A5009957887","display_name":"Ryan A. Rossi","orcid":"https://orcid.org/0000-0001-9758-0635"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ryan A. Rossi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084102378","display_name":"David F. Gleich","orcid":"https://orcid.org/0000-0002-8107-6474"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David F. Gleich","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5049685547","display_name":"Assefaw H. Gebremedhin","orcid":"https://orcid.org/0000-0001-5383-8032"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Assefaw H. Gebremedhin","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5009957887"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.5788,"has_fulltext":false,"cited_by_count":106,"citation_normalized_percentile":{"value":0.92564896,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"37","issue":"5","first_page":"C589","last_page":"C616"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998999834060669,"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.9998999834060669,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9896000027656555,"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/T11478","display_name":"Caching and Content Delivery","score":0.984000027179718,"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/pruning","display_name":"Pruning","score":0.6860396265983582},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.6852685809135437},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5739482641220093},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5678591728210449},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.5476547479629517},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5374686121940613},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5059213042259216},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.4778806269168854},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4284267723560333},{"id":"https://openalex.org/keywords/clique-percolation-method","display_name":"Clique percolation method","score":0.42055195569992065},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4109506607055664},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.40418267250061035},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38605958223342896},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31570035219192505},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1966298222541809},{"id":"https://openalex.org/keywords/complex-network","display_name":"Complex network","score":0.17090478539466858},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.16341623663902283},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15829285979270935},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.11287853121757507},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11086368560791016}],"concepts":[{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6860396265983582},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6852685809135437},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5739482641220093},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5678591728210449},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.5476547479629517},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5374686121940613},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5059213042259216},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4778806269168854},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4284267723560333},{"id":"https://openalex.org/C128243737","wikidata":"https://www.wikidata.org/wiki/Q5134414","display_name":"Clique percolation method","level":3,"score":0.42055195569992065},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4109506607055664},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.40418267250061035},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38605958223342896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31570035219192505},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1966298222541809},{"id":"https://openalex.org/C34947359","wikidata":"https://www.wikidata.org/wiki/Q665189","display_name":"Complex network","level":2,"score":0.17090478539466858},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.16341623663902283},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15829285979270935},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.11287853121757507},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11086368560791016},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","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},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/14100018x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/14100018x","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":67,"referenced_works":["https://openalex.org/W75795297","https://openalex.org/W91442942","https://openalex.org/W229097380","https://openalex.org/W1485742133","https://openalex.org/W1518080829","https://openalex.org/W1535144194","https://openalex.org/W1536504533","https://openalex.org/W1567562836","https://openalex.org/W1594951361","https://openalex.org/W1849256610","https://openalex.org/W1963605141","https://openalex.org/W1967006938","https://openalex.org/W1971010887","https://openalex.org/W1978024959","https://openalex.org/W1985718595","https://openalex.org/W1994704968","https://openalex.org/W1994727615","https://openalex.org/W1998341696","https://openalex.org/W2000273502","https://openalex.org/W2003010406","https://openalex.org/W2010772252","https://openalex.org/W2016210071","https://openalex.org/W2022704179","https://openalex.org/W2028393984","https://openalex.org/W2043770080","https://openalex.org/W2046112356","https://openalex.org/W2046270811","https://openalex.org/W2047443612","https://openalex.org/W2052104835","https://openalex.org/W2056124433","https://openalex.org/W2057046770","https://openalex.org/W2066200594","https://openalex.org/W2068617151","https://openalex.org/W2071864549","https://openalex.org/W2073415627","https://openalex.org/W2082195599","https://openalex.org/W2082603400","https://openalex.org/W2082773934","https://openalex.org/W2085322739","https://openalex.org/W2101196063","https://openalex.org/W2110953678","https://openalex.org/W2116007667","https://openalex.org/W2132991500","https://openalex.org/W2137135938","https://openalex.org/W2139905147","https://openalex.org/W2143444146","https://openalex.org/W2143554828","https://openalex.org/W2144885342","https://openalex.org/W2146591355","https://openalex.org/W2148606255","https://openalex.org/W2149454052","https://openalex.org/W2150256170","https://openalex.org/W2154656661","https://openalex.org/W2156206152","https://openalex.org/W2160429376","https://openalex.org/W2166742555","https://openalex.org/W2183091601","https://openalex.org/W2403629185","https://openalex.org/W2518113606","https://openalex.org/W2571329707","https://openalex.org/W2950113750","https://openalex.org/W3102945079","https://openalex.org/W3103786587","https://openalex.org/W4211250195","https://openalex.org/W4250699352","https://openalex.org/W4285719527","https://openalex.org/W4294553782"],"related_works":["https://openalex.org/W3128179121","https://openalex.org/W2165678151","https://openalex.org/W2901381533","https://openalex.org/W3040412425","https://openalex.org/W2470344702","https://openalex.org/W2090033344","https://openalex.org/W2211760951","https://openalex.org/W2474123243","https://openalex.org/W4308444844","https://openalex.org/W1823437338"],"abstract_inverted_index":{"We":[0,158],"present":[1],"a":[2,26,36,39,44,47,70,93,143],"fast,":[3],"parallel":[4],"maximum":[5,134],"clique":[6,59],"algorithm":[7,55,68,164],"for":[8],"large":[9,149],"sparse":[10],"graphs":[11],"that":[12],"is":[13,115],"designed":[14],"to":[15,38,98,124],"exploit":[16],"characteristics":[17],"of":[18,86,89,103,111,132,138,162,174,183,186,188],"social":[19,48],"and":[20,75,126,181],"information":[21,139],"networks.":[22,190],"The":[23,79],"method":[24],"exhibits":[25],"roughly":[27],"linear":[28],"runtime":[29],"scaling":[30],"over":[31],"real-world":[32],"networks":[33,180],"ranging":[34],"from":[35],"thousand":[37],"hundred":[40],"million":[41],"nodes.":[42],"In":[43,107],"test":[45],"on":[46,129,165],"network":[49,170],"with":[50,73,92,148],"1.8":[51],"billion":[52],"edges,":[53],"the":[54,57,67,83,100,104,109,112,118,130,133,160,163],"finds":[56],"largest":[58],"in":[60,142,178],"about":[61],"20":[62],"minutes.":[63],"At":[64],"its":[65],"heart":[66],"employs":[69],"branch-and-bound":[71],"strategy":[72],"novel":[74],"aggressive":[76],"pruning":[77,80],"techniques.":[78],"techniques":[81],"include":[82],"combined":[84],"use":[85],"core":[87],"numbers":[88],"vertices":[90],"along":[91],"good":[94],"initial":[95],"heuristic":[96],"solution":[97],"remove":[99],"vast":[101],"majority":[102],"search":[105,113,150],"space.":[106],"addition,":[108],"exploration":[110],"tree":[114],"parallelized.":[116],"During":[117],"search,":[119],"processes":[120],"immediately":[121],"communicate":[122],"changes":[123],"upper":[125],"lower":[127],"bounds":[128],"size":[131],"clique.":[135],"This":[136],"exchange":[137],"occasionally":[140],"results":[141],"superlinear":[144],"speedup":[145],"because":[146],"tasks":[147],"spaces":[151],"can":[152],"be":[153],"pruned":[154],"by":[155],"other":[156],"processes.":[157],"demonstrate":[159],"impact":[161],"applications":[166],"using":[167],"two":[168],"different":[169],"analysis":[171],"problems:":[172],"computation":[173],"temporal":[175],"strong":[176],"components":[177],"dynamic":[179],"determination":[182],"compression-friendly":[184],"ordering":[185],"nodes":[187],"massive":[189]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":12},{"year":2024,"cited_by_count":14},{"year":2023,"cited_by_count":16},{"year":2022,"cited_by_count":16},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":18},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}