{"id":"https://openalex.org/W9324657","doi":"https://doi.org/10.1007/bf02243394","title":"A fast algorithm for the maximum weight clique problem","display_name":"A fast algorithm for the maximum weight clique problem","publication_year":1994,"publication_date":"1994-03-01","ids":{"openalex":"https://openalex.org/W9324657","doi":"https://doi.org/10.1007/bf02243394","mag":"9324657"},"language":"en","primary_location":{"id":"doi:10.1007/bf02243394","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02243394","pdf_url":null,"source":{"id":"https://openalex.org/S35593046","display_name":"Computing","issn_l":"0010-485X","issn":["0010-485X","1436-5057"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"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/A5048581332","display_name":"Luitpold Babel","orcid":"https://orcid.org/0000-0001-5436-1299"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"L. Babel","raw_affiliation_strings":["Institut f\u00fcr Mathematik TU-M\u00fcnchen, Arcisstrasse 21, D-80290, M\u00fcnchen, Federal Republic of Germany","Institut f\u00fcr Mathematik TU-M\u00fcnchen, M\u00fcnchen, Federal Republic of Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik TU-M\u00fcnchen, Arcisstrasse 21, D-80290, M\u00fcnchen, Federal Republic of Germany","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"Institut f\u00fcr Mathematik TU-M\u00fcnchen, M\u00fcnchen, Federal Republic of Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5048581332"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.9309,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.70625065,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"52","issue":"1","first_page":"31","last_page":"38"},"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.9994000196456909,"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.9994000196456909,"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.9984999895095825,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.6237177848815918},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.584257960319519},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5785735249519348},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.564460039138794},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5548787117004395},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.5338842272758484},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5091592669487},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49823880195617676},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.48726025223731995},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.4632832407951355},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.44944289326667786},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.44094622135162354},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33900120854377747},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3374534249305725},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.27065640687942505},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.1706606149673462},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.11195355653762817},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06380552053451538},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.05911356210708618}],"concepts":[{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6237177848815918},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.584257960319519},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5785735249519348},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.564460039138794},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5548787117004395},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.5338842272758484},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5091592669487},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49823880195617676},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.48726025223731995},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.4632832407951355},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.44944289326667786},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.44094622135162354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33900120854377747},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3374534249305725},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27065640687942505},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.1706606149673462},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.11195355653762817},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06380552053451538},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.05911356210708618},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","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},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf02243394","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02243394","pdf_url":null,"source":{"id":"https://openalex.org/S35593046","display_name":"Computing","issn_l":"0010-485X","issn":["0010-485X","1436-5057"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1512959368","https://openalex.org/W1968876216","https://openalex.org/W2009789570","https://openalex.org/W2011191524","https://openalex.org/W2013415302","https://openalex.org/W2026320281","https://openalex.org/W2043005464","https://openalex.org/W2048053250","https://openalex.org/W2048347878","https://openalex.org/W2048440507","https://openalex.org/W2066554880","https://openalex.org/W2088500299","https://openalex.org/W2167036627","https://openalex.org/W4253314095"],"related_works":["https://openalex.org/W3121666834","https://openalex.org/W2951533720","https://openalex.org/W119756842","https://openalex.org/W2794565019","https://openalex.org/W4300229885","https://openalex.org/W2891037262","https://openalex.org/W1487885374","https://openalex.org/W2162082186","https://openalex.org/W4285171291","https://openalex.org/W4224326468"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}