{"id":"https://openalex.org/W2100505346","doi":"https://doi.org/10.1007/3-540-45066-1_22","title":"An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique","display_name":"An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2100505346","doi":"https://doi.org/10.1007/3-540-45066-1_22","mag":"2100505346"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45066-1_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45066-1_22","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5102321735","display_name":"Etsuji Tomita","orcid":null},"institutions":[{"id":"https://openalex.org/I20529979","display_name":"University of Electro-Communications","ror":"https://ror.org/02x73b849","country_code":"JP","type":"education","lineage":["https://openalex.org/I20529979"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Etsuji Tomita","raw_affiliation_strings":["The Graduate School of Electro-Communications, The University of Electro-Communications, Chofugaoka 1-5-1, Chofu, Tokyo, 182-8585, Japan","The Graduate School of Electro-Communications, The University of Electro-Communications, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"The Graduate School of Electro-Communications, The University of Electro-Communications, Chofugaoka 1-5-1, Chofu, Tokyo, 182-8585, Japan","institution_ids":["https://openalex.org/I20529979"]},{"raw_affiliation_string":"The Graduate School of Electro-Communications, The University of Electro-Communications, Tokyo, Japan","institution_ids":["https://openalex.org/I20529979"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046079521","display_name":"Tomokazu Seki","orcid":null},"institutions":[{"id":"https://openalex.org/I20529979","display_name":"University of Electro-Communications","ror":"https://ror.org/02x73b849","country_code":"JP","type":"education","lineage":["https://openalex.org/I20529979"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tomokazu Seki","raw_affiliation_strings":["The Graduate School of Electro-Communications, The University of Electro-Communications, Chofugaoka 1-5-1, Chofu, Tokyo, 182-8585, Japan","The Graduate School of Electro-Communications, The University of Electro-Communications, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"The Graduate School of Electro-Communications, The University of Electro-Communications, Chofugaoka 1-5-1, Chofu, Tokyo, 182-8585, Japan","institution_ids":["https://openalex.org/I20529979"]},{"raw_affiliation_string":"The Graduate School of Electro-Communications, The University of Electro-Communications, Tokyo, Japan","institution_ids":["https://openalex.org/I20529979"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102321735"],"corresponding_institution_ids":["https://openalex.org/I20529979"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":8.9916,"has_fulltext":false,"cited_by_count":201,"citation_normalized_percentile":{"value":0.98346457,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"278","last_page":"289"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9991000294685364,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.7853386402130127},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6226193308830261},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5203104019165039},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4745420217514038},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4570496380329132},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45702123641967773},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4514925479888916},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.4464454650878906},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3973863124847412},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35607966780662537},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3313221335411072},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25195223093032837},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1517903208732605},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.14317810535430908},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.10275599360466003}],"concepts":[{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.7853386402130127},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6226193308830261},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5203104019165039},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4745420217514038},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4570496380329132},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45702123641967773},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4514925479888916},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.4464454650878906},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3973863124847412},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35607966780662537},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3313221335411072},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25195223093032837},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1517903208732605},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.14317810535430908},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.10275599360466003},{"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-45066-1_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45066-1_22","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W2002747011","https://openalex.org/W2026320281","https://openalex.org/W2043005464","https://openalex.org/W2046112356","https://openalex.org/W2065141624","https://openalex.org/W2082603400","https://openalex.org/W2134155515","https://openalex.org/W2145570573","https://openalex.org/W2398665108","https://openalex.org/W2588278284","https://openalex.org/W2607539118","https://openalex.org/W2912347902","https://openalex.org/W4211250195","https://openalex.org/W4236680666","https://openalex.org/W6737531898"],"related_works":["https://openalex.org/W3121666834","https://openalex.org/W2951533720","https://openalex.org/W119756842","https://openalex.org/W2794565019","https://openalex.org/W2891037262","https://openalex.org/W4300229885","https://openalex.org/W1487885374","https://openalex.org/W2162082186","https://openalex.org/W4285171291","https://openalex.org/W4224326468"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":16},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":17},{"year":2014,"cited_by_count":17},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":8}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}