Results 1 
2 of
2
On reducing maximum independent set to minimum satisfiability
 In International Conference on Theory and Applications of Satisfiability Testing
, 2014
"... Abstract. Maximum Independent Set (MIS) is a wellknown NPhard graph problem, tightly related with other well known NPhard graph problems, namely Minimum Vertex Cover (MVC) and Maximum Clique (MaxClq). This paper introduces a novel reduction of MIS into Minimum Satisfiability (MinSAT), thus, prov ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Maximum Independent Set (MIS) is a wellknown NPhard graph problem, tightly related with other well known NPhard graph problems, namely Minimum Vertex Cover (MVC) and Maximum Clique (MaxClq). This paper introduces a novel reduction of MIS into Minimum Satisfiability (MinSAT), thus, providing an alternative approach for solving MIS. The reduction naturally maps the vertices of a graph into clauses, without requiring the inclusion of hard clauses. Moreover, it is shown that the proposed reduction uses fewer variables and clauses than the existing alternative of mapping MIS into Maximum Satisfiability (MaxSAT). The paper develops a number of optimizations to the basic reduction, which significantly reduce the total number of variables used. The experimental evaluation considered the reductions described in the paper as well as existing stateoftheart approaches. The results show that the proposed approaches based on MinSAT are competitive with existing approaches. 1