{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T05:28:32Z","timestamp":1740202112512,"version":"3.37.3"},"reference-count":0,"publisher":"IOS Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"abstract":"<jats:p>Given a simple graph G=&amp;lpar;V,E&amp;rpar;, the problem dealt with in this paper ask to transform a graph G by, only removing a minimum number of edges, into a disjoint union of cliques. This optimization problem is known to be NP-hard and is referred to as the Cluster Deletion problem (CD). This observation has motivated us to improve the chance for finding a disjoint union of cliques in a limited amount of search. To this end, we propose an encoding of CD in terms of a Weighted Constraint Satisfaction Problem (WCSP), a framework which has been widely used in solving hard combinatorial problems.<\/jats:p>","DOI":"10.3233\/978-1-61499-589-0-98","type":"book-chapter","created":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:26:53Z","timestamp":1740133613000},"source":"Crossref","is-referenced-by-count":0,"title":["A Constraint Programming Approach to the Cluster Deletion Problem"],"prefix":"10.3233","author":[{"family":"Mhamdi Amel","sequence":"additional","affiliation":[]},{"family":"Naanaa Wady","sequence":"additional","affiliation":[]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","Thirteenth Scandinavian Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:30:20Z","timestamp":1740137420000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospressISBN&isbn=978-1-61499-588-3&spage=98&doi=10.3233\/978-1-61499-589-0-98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/978-1-61499-589-0-98","relation":{},"ISSN":["0922-6389"],"issn-type":[{"value":"0922-6389","type":"print"}],"subject":[],"published":{"date-parts":[[2015]]}}}