{"id":"https://openalex.org/W2078489643","doi":"https://doi.org/10.1016/0012-365x(88)90207-5","title":"Hard graphs for the maximum clique problem","display_name":"Hard graphs for the maximum clique problem","publication_year":1988,"publication_date":"1988-12-01","ids":{"openalex":"https://openalex.org/W2078489643","doi":"https://doi.org/10.1016/0012-365x(88)90207-5","mag":"2078489643"},"language":"en","primary_location":{"id":"doi:10.1016/0012-365x(88)90207-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0012-365x(88)90207-5","pdf_url":null,"source":{"id":"https://openalex.org/S18902827","display_name":"Discrete Mathematics","issn_l":"0012-365X","issn":["0012-365X","1872-681X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ris.utwente.nl/ws/files/6793115/Hoede88hard.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111939517","display_name":"Cornelis Hoede","orcid":null},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Cornelis Hoede","raw_affiliation_strings":["Twente University of Technology, Department of Applied Mathematics, P.O. Box 217, 7500 AE Enschede, The Netherlands","Twente University of Technology, Department of Applied Mathematics, P.O. Box 217, 7500 A E Enschede, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Twente University of Technology, Department of Applied Mathematics, P.O. Box 217, 7500 AE Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]},{"raw_affiliation_string":"Twente University of Technology, Department of Applied Mathematics, P.O. Box 217, 7500 A E Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111939517"],"corresponding_institution_ids":["https://openalex.org/I94624287"],"apc_list":{"value":3000,"currency":"USD","value_usd":3000},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.22271544,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"72","issue":"1-3","first_page":"175","last_page":"179"},"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.9988999962806702,"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.9988999962806702,"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.9972000122070312,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7398303151130676},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.7098748683929443},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7044453620910645},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.695819079875946},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.6876689195632935},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.644075334072113},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.6068220734596252},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.5560561418533325},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.5349750518798828},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5252147316932678},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.4992024898529053},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4859065115451813},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.4756873846054077},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.45621222257614136},{"id":"https://openalex.org/keywords/metric-dimension","display_name":"Metric dimension","score":0.45478805899620056},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.38865724205970764},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21313893795013428},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08410051465034485}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7398303151130676},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.7098748683929443},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7044453620910645},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.695819079875946},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.6876689195632935},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.644075334072113},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.6068220734596252},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5560561418533325},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.5349750518798828},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5252147316932678},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.4992024898529053},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4859065115451813},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4756873846054077},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.45621222257614136},{"id":"https://openalex.org/C60933471","wikidata":"https://www.wikidata.org/wiki/Q17152964","display_name":"Metric dimension","level":5,"score":0.45478805899620056},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.38865724205970764},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21313893795013428},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08410051465034485},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/0012-365x(88)90207-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0012-365x(88)90207-5","pdf_url":null,"source":{"id":"https://openalex.org/S18902827","display_name":"Discrete Mathematics","issn_l":"0012-365X","issn":["0012-365X","1872-681X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:openaire/44766cf7-d80b-4084-a95f-fb745c61ae1e","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/44766cf7-d80b-4084-a95f-fb745c61ae1e","pdf_url":"https://ris.utwente.nl/ws/files/6793115/Hoede88hard.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hoede, C 1988, 'Hard graphs for the maximum clique problem', Discrete mathematics, vol. 72, no. 1-3, pp. 175-179. https://doi.org/10.1016/0012-365X(88)90207-5","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:ris.utwente.nl:publications/44766cf7-d80b-4084-a95f-fb745c61ae1e","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:openaire/44766cf7-d80b-4084-a95f-fb745c61ae1e","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/44766cf7-d80b-4084-a95f-fb745c61ae1e","pdf_url":"https://ris.utwente.nl/ws/files/6793115/Hoede88hard.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hoede, C 1988, 'Hard graphs for the maximum clique problem', Discrete mathematics, vol. 72, no. 1-3, pp. 175-179. https://doi.org/10.1016/0012-365X(88)90207-5","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2078489643.pdf","grobid_xml":"https://content.openalex.org/works/W2078489643.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W1963707128","https://openalex.org/W1991410678","https://openalex.org/W2001258629","https://openalex.org/W2097844290","https://openalex.org/W2799004609"],"related_works":["https://openalex.org/W2898526288","https://openalex.org/W2046263886","https://openalex.org/W2004663694","https://openalex.org/W2607123191","https://openalex.org/W2078489643","https://openalex.org/W77483341","https://openalex.org/W2045135589","https://openalex.org/W2599254863","https://openalex.org/W2949556766","https://openalex.org/W4300330793"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-17T09:09:15.849793","created_date":"2025-10-10T00:00:00"}