{"id":"https://openalex.org/W2069537431","doi":"https://doi.org/10.1007/s11590-014-0837-4","title":"A parallel branch and bound algorithm for the maximum labelled clique problem","display_name":"A parallel branch and bound algorithm for the maximum labelled clique problem","publication_year":2014,"publication_date":"2014-12-09","ids":{"openalex":"https://openalex.org/W2069537431","doi":"https://doi.org/10.1007/s11590-014-0837-4","mag":"2069537431"},"language":"en","primary_location":{"id":"doi:10.1007/s11590-014-0837-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-014-0837-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-014-0837-4.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s11590-014-0837-4.pdf","any_repository_has_fulltext":false},"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":["University of Glasgow, Glasgow, Scotland","Univ. of Glasgow, Glasgow, Scotland"],"affiliations":[{"raw_affiliation_string":"University of Glasgow, Glasgow, Scotland","institution_ids":["https://openalex.org/I7882870"]},{"raw_affiliation_string":"Univ. of Glasgow, Glasgow, Scotland","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":["University of Glasgow, Glasgow, Scotland","University of Glasgow"],"affiliations":[{"raw_affiliation_string":"University of Glasgow, Glasgow, Scotland","institution_ids":["https://openalex.org/I7882870"]},{"raw_affiliation_string":"University of Glasgow","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":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2587,"currency":"EUR","value_usd":2790},"fwci":1.2685,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.85318169,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"9","issue":"5","first_page":"949","last_page":"960"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9970999956130981,"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"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9970999956130981,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9966999888420105,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.8222101926803589},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.7177796363830566},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6740186214447021},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6368314027786255},{"id":"https://openalex.org/keywords/computational-intelligence","display_name":"Computational intelligence","score":0.5721529722213745},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.5353679060935974},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4969020187854767},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48061057925224304},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47448137402534485},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47003763914108276},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45918625593185425},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43551087379455566},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4259953498840332},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15544381737709045},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.12187758088111877},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06083020567893982}],"concepts":[{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.8222101926803589},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.7177796363830566},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6740186214447021},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6368314027786255},{"id":"https://openalex.org/C139502532","wikidata":"https://www.wikidata.org/wiki/Q1122090","display_name":"Computational intelligence","level":2,"score":0.5721529722213745},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.5353679060935974},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4969020187854767},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48061057925224304},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47448137402534485},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47003763914108276},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45918625593185425},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43551087379455566},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4259953498840332},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15544381737709045},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.12187758088111877},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06083020567893982},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s11590-014-0837-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-014-0837-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-014-0837-4.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"},{"id":"pmh:oai:eprints.gla.ac.uk:100631","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"}],"best_oa_location":{"id":"doi:10.1007/s11590-014-0837-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-014-0837-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-014-0837-4.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1934935867","display_name":null,"funder_award_id":"Engineering and Physical Sciences R","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G755360841","display_name":"DTA - University of Glasgow","funder_award_id":"EP/K503058/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8976285554","display_name":null,"funder_award_id":"EP/K503058","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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2069537431.pdf","grobid_xml":"https://content.openalex.org/works/W2069537431.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W133702756","https://openalex.org/W1563121416","https://openalex.org/W1594785451","https://openalex.org/W1803317566","https://openalex.org/W2003010406","https://openalex.org/W2005933636","https://openalex.org/W2008362324","https://openalex.org/W2024685656","https://openalex.org/W2028393984","https://openalex.org/W2068617151","https://openalex.org/W2087872740","https://openalex.org/W2100505346","https://openalex.org/W2118433174","https://openalex.org/W2166742555","https://openalex.org/W2296274211","https://openalex.org/W3103809129"],"related_works":["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","https://openalex.org/W4224326468"],"abstract_inverted_index":{"The":[0],"maximum":[1,10],"labelled":[2],"clique":[3,11],"problem":[4,12],"is":[5,69],"a":[6,30,37,41,60],"variant":[7],"of":[8,33,62,82],"the":[9,16,46],"where":[13],"edges":[14],"in":[15,36],"graph":[17],"are":[18,23],"given":[19],"labels,":[20],"and":[21,48,65],"we":[22],"not":[24],"allowed":[25],"to":[26],"use":[27],"more":[28],"than":[29,72],"certain":[31],"number":[32],"distinct":[34],"labels":[35],"solution.":[38],"We":[39,55],"introduce":[40],"new":[42],"branch-and-bound":[43],"algorithm":[44],"for":[45],"problem,":[47],"explain":[49],"how":[50],"it":[51,68],"may":[52],"be":[53],"parallelised.":[54],"evaluate":[56],"an":[57],"implementation":[58],"on":[59],"set":[61],"benchmark":[63],"instances,":[64],"show":[66],"that":[67],"consistently":[70],"faster":[71],"previously":[73],"published":[74],"results,":[75],"sometimes":[76],"by":[77],"four":[78],"or":[79],"five":[80],"orders":[81],"magnitude.":[83]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}