{"id":"https://openalex.org/W2296274211","doi":"https://doi.org/10.1007/978-3-319-09584-4_12","title":"Initial Sorting of Vertices in the Maximum Clique Problem Reviewed","display_name":"Initial Sorting of Vertices in the Maximum Clique Problem Reviewed","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2296274211","doi":"https://doi.org/10.1007/978-3-319-09584-4_12","mag":"2296274211"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-09584-4_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-09584-4_12","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/A5075752573","display_name":"Pablo San Segundo","orcid":"https://orcid.org/0000-0001-7050-5563"},"institutions":[{"id":"https://openalex.org/I4210125392","display_name":"Centre for Automation and Robotics","ror":"https://ror.org/02wh02235","country_code":"ES","type":"facility","lineage":["https://openalex.org/I134820265","https://openalex.org/I4210125392","https://openalex.org/I88060688"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"Pablo San Segundo","raw_affiliation_strings":["Centre of Automatics and Robotics (UPM-CSIC), Jose Guti\u00e9rrez Abascal, 2, 28006, Madrid, Spain"],"affiliations":[{"raw_affiliation_string":"Centre of Automatics and Robotics (UPM-CSIC), Jose Guti\u00e9rrez Abascal, 2, 28006, Madrid, Spain","institution_ids":["https://openalex.org/I4210125392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042049305","display_name":"Alvaro Lopez","orcid":null},"institutions":[{"id":"https://openalex.org/I4210125392","display_name":"Centre for Automation and Robotics","ror":"https://ror.org/02wh02235","country_code":"ES","type":"facility","lineage":["https://openalex.org/I134820265","https://openalex.org/I4210125392","https://openalex.org/I88060688"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Alvaro Lopez","raw_affiliation_strings":["Centre of Automatics and Robotics (UPM-CSIC), Jose Guti\u00e9rrez Abascal, 2, 28006, Madrid, Spain"],"affiliations":[{"raw_affiliation_string":"Centre of Automatics and Robotics (UPM-CSIC), Jose Guti\u00e9rrez Abascal, 2, 28006, Madrid, Spain","institution_ids":["https://openalex.org/I4210125392"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019206200","display_name":"Mikhail Batsyn","orcid":"https://orcid.org/0000-0002-0302-2673"},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Mikhail Batsyn","raw_affiliation_strings":["Laboratory of Algorithms and Technologies for Networks Analysis, National Research University Higher School of Economics, 136 Rodionova, Nizhny Novgorod, Russian Federation"],"affiliations":[{"raw_affiliation_string":"Laboratory of Algorithms and Technologies for Networks Analysis, National Research University Higher School of Economics, 136 Rodionova, Nizhny Novgorod, Russian Federation","institution_ids":["https://openalex.org/I118501908"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5075752573"],"corresponding_institution_ids":["https://openalex.org/I4210125392"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.9855,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.91439291,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"111","last_page":"120"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9940999746322632,"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.9940999746322632,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9912999868392944,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9908999800682068,"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/computer-science","display_name":"Computer science","score":0.6775484085083008},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6182988882064819},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.6107330322265625},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6047807931900024},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5971078276634216},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.5394469499588013},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5339291095733643},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.47876039147377014},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.458662211894989},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45288753509521484},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.4366539418697357},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4148634374141693},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3994984030723572},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3846035599708557},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32731229066848755},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24670150876045227},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.07989740371704102}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6775484085083008},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6182988882064819},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6107330322265625},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6047807931900024},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5971078276634216},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.5394469499588013},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5339291095733643},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47876039147377014},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.458662211894989},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45288753509521484},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.4366539418697357},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4148634374141693},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3994984030723572},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3846035599708557},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32731229066848755},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24670150876045227},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.07989740371704102},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"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/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-09584-4_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-09584-4_12","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W749637598","https://openalex.org/W1516453703","https://openalex.org/W1594785451","https://openalex.org/W1964153150","https://openalex.org/W1969335781","https://openalex.org/W2001898386","https://openalex.org/W2008362324","https://openalex.org/W2026320281","https://openalex.org/W2028393984","https://openalex.org/W2035372875","https://openalex.org/W2043005464","https://openalex.org/W2068617151","https://openalex.org/W2094224753","https://openalex.org/W2096592688","https://openalex.org/W2098667053","https://openalex.org/W2100505346","https://openalex.org/W2116007667","https://openalex.org/W2170659335","https://openalex.org/W2171103562","https://openalex.org/W2260474806","https://openalex.org/W2506088122","https://openalex.org/W3103809129"],"related_works":["https://openalex.org/W2165678151","https://openalex.org/W1796509207","https://openalex.org/W2082603400","https://openalex.org/W3203939381","https://openalex.org/W2140498717","https://openalex.org/W858234464","https://openalex.org/W4285171291","https://openalex.org/W2162082186","https://openalex.org/W2951533720","https://openalex.org/W2389368518"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}