{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T04:45:46Z","timestamp":1773809146161,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8994,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1016\/0012-365x(88)90207-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"175-179","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["Hard graphs for the maximum clique problem"],"prefix":"10.1016","volume":"72","author":[{"given":"Cornelis","family":"Hoede","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(88)90207-5_BIB1","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(88)90207-5_BIB2","series-title":"Graph theory","author":"Harary","year":"1969"},{"key":"10.1016\/0012-365X(88)90207-5_BIB3","series-title":"Memorandum nr. 547","article-title":"Semi-matchings and semi-stars, surroundings, decompositions and detachments. An analysis of the maximum clique problem","author":"Hoede","year":"1985"},{"key":"10.1016\/0012-365X(88)90207-5_BIB4","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","article-title":"On maximal independent sets of vertices in claw-free graphs","volume":"28","author":"Minty","year":"1980","journal-title":"J. Combin. Theory (B)"},{"key":"10.1016\/0012-365X(88)90207-5_BIB5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","article-title":"Algorithme de recherche d'un stable de cardinalit\u00e9 maximum dans un graph sans \u00e9toile","volume":"29","author":"Sbihi","year":"1980","journal-title":"Discrete Mathem."},{"issue":"no. 3","key":"10.1016\/0012-365X(88)90207-5_BIB6","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1137\/0206038","article-title":"Finding a maximum independent set","volume":"6","author":"Tarjan","year":"1977","journal-title":"SIAM J. Computation"},{"issue":"no. 1","key":"10.1016\/0012-365X(88)90207-5_BIB7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0190(81)90072-7","article-title":"An algorithm for finding clique cut-sets","volume":"12","author":"Whitesides","year":"1981","journal-title":"Information Processing Letters"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X88902075?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X88902075?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T13:35:06Z","timestamp":1757079306000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X88902075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["0012365X88902075"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(88)90207-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hard graphs for the maximum clique problem","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0012-365X(88)90207-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1988 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}