{"id":"https://openalex.org/W2003010406","doi":"https://doi.org/10.3390/a6040618","title":"Multi-Threading a State-of-the-Art Maximum Clique Algorithm","display_name":"Multi-Threading a State-of-the-Art Maximum Clique Algorithm","publication_year":2013,"publication_date":"2013-10-03","ids":{"openalex":"https://openalex.org/W2003010406","doi":"https://doi.org/10.3390/a6040618","mag":"2003010406"},"language":"en","primary_location":{"id":"doi:10.3390/a6040618","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6040618","pdf_url":"https://www.mdpi.com/1999-4893/6/4/618/pdf?version=1380799931","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/6/4/618/pdf?version=1380799931","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039605149","display_name":"Ciaran McCreesh","orcid":"https://orcid.org/0000-0002-6106-4871"},"institutions":[{"id":"https://openalex.org/I7882870","display_name":"University of Glasgow","ror":"https://ror.org/00vtgdb53","country_code":"GB","type":"education","lineage":["https://openalex.org/I7882870"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Ciaran McCreesh","raw_affiliation_strings":["School of Computing Science, University of Glasgow, Glasgow G12 8QQ, UK"],"affiliations":[{"raw_affiliation_string":"School of Computing Science, University of Glasgow, Glasgow G12 8QQ, UK","institution_ids":["https://openalex.org/I7882870"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070869501","display_name":"Patrick Prosser","orcid":"https://orcid.org/0000-0003-4460-6912"},"institutions":[{"id":"https://openalex.org/I7882870","display_name":"University of Glasgow","ror":"https://ror.org/00vtgdb53","country_code":"GB","type":"education","lineage":["https://openalex.org/I7882870"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Patrick Prosser","raw_affiliation_strings":["School of Computing Science, University of Glasgow, Glasgow G12 8QQ, UK"],"affiliations":[{"raw_affiliation_string":"School of Computing Science, University of Glasgow, Glasgow G12 8QQ, UK","institution_ids":["https://openalex.org/I7882870"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5039605149"],"corresponding_institution_ids":["https://openalex.org/I7882870"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":9.0635,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.98338069,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"6","issue":"4","first_page":"618","last_page":"635"},"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.9998000264167786,"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.9998000264167786,"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.9959999918937683,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.7596233487129211},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7592393755912781},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.664966881275177},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.5667659044265747},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5118078589439392},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4562671184539795},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.4129890203475952},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3419826626777649},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30614137649536133},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22999060153961182},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18552330136299133},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16052520275115967},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.07693696022033691}],"concepts":[{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.7596233487129211},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7592393755912781},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.664966881275177},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.5667659044265747},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5118078589439392},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4562671184539795},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.4129890203475952},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3419826626777649},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30614137649536133},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22999060153961182},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18552330136299133},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16052520275115967},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.07693696022033691},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"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/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a6040618","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6040618","pdf_url":"https://www.mdpi.com/1999-4893/6/4/618/pdf?version=1380799931","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:eprints.gla.ac.uk:86452","is_oa":false,"landing_page_url":"http://eprints.gla.ac.uk/view/author/36024.html>","pdf_url":null,"source":{"id":"https://openalex.org/S4210235606","display_name":"ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)","issn_l":"2622-8912","issn":["2622-8912","2622-8920"],"is_oa":false,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},{"id":"pmh:oai:doaj.org/article:a482cf5aa1a941559db4d3a65f09e4fe","is_oa":true,"landing_page_url":"https://doaj.org/article/a482cf5aa1a941559db4d3a65f09e4fe","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 6, Iss 4, Pp 618-635 (2013)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/6/4/618/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a6040618","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 6; Issue 4; Pages: 618-635","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a6040618","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6040618","pdf_url":"https://www.mdpi.com/1999-4893/6/4/618/pdf?version=1380799931","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2003010406.pdf","grobid_xml":"https://content.openalex.org/works/W2003010406.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W2611328","https://openalex.org/W16033842","https://openalex.org/W55478891","https://openalex.org/W75795297","https://openalex.org/W89914616","https://openalex.org/W1499240152","https://openalex.org/W1527655377","https://openalex.org/W1594785451","https://openalex.org/W1620410031","https://openalex.org/W1849256610","https://openalex.org/W1979566015","https://openalex.org/W1988845780","https://openalex.org/W2005933636","https://openalex.org/W2008362324","https://openalex.org/W2011039300","https://openalex.org/W2028393984","https://openalex.org/W2035372875","https://openalex.org/W2060032012","https://openalex.org/W2068617151","https://openalex.org/W2082603400","https://openalex.org/W2096592688","https://openalex.org/W2100505346","https://openalex.org/W2115353894","https://openalex.org/W2154472352","https://openalex.org/W2166742555","https://openalex.org/W2249344705","https://openalex.org/W2951947541","https://openalex.org/W3103809129","https://openalex.org/W4285719527","https://openalex.org/W6602259970","https://openalex.org/W6671166549","https://openalex.org/W6674682801","https://openalex.org/W6691343681"],"related_works":["https://openalex.org/W2960805326","https://openalex.org/W3121666834","https://openalex.org/W2951533720","https://openalex.org/W2794565019","https://openalex.org/W4300229885","https://openalex.org/W2891037262","https://openalex.org/W2162082186","https://openalex.org/W4285171291","https://openalex.org/W1487885374","https://openalex.org/W2550802162"],"abstract_inverted_index":{"We":[0,17,32],"present":[1],"a":[2,7],"threaded":[3],"parallel":[4],"adaptation":[5],"of":[6],"state-of-the-art":[8],"maximum":[9],"clique":[10],"algorithm":[11],"for":[12,35],"dense,":[13],"computationally":[14],"challenging":[15],"graphs.":[16],"show":[18],"that":[19,27],"near-linear":[20],"speedups":[21,29],"are":[22,30],"achievable":[23],"in":[24],"practice":[25],"and":[26],"superlinear":[28],"common.":[31],"include":[33],"results":[34],"several":[36],"previously":[37],"unsolved":[38],"benchmark":[39],"problems.":[40]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}