{"title":"Edges","authors":"D. Dilworth","doi":"10.1088/978-0-7503-3695-6ch40","DOIUrl":"https://doi.org/10.1088/978-0-7503-3695-6ch40","url":null,"abstract":". We extend the notion of clique to almost-clique wherein 100 edges are allowed not to be present but are required to be covered by at most two nodes. Given a graph G ( V,E ), we shall show that deciding whether G has an almost-clique of size k is a hard computational problem.","PeriodicalId":238625,"journal":{"name":"Lens Design (Second Edition)","volume":"01 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132883998","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}