GCP Constraint Based SAT Clause Generation in Polynomial Time
Main Article Content
Abstract
Graph Colorability Problem (GCP) belongs to a subset of the large family of NP–Hard combinatorial problems. Till now there exist very less deterministic methods to find the solutions to k- Color problem. Constraint analysis of the k-Color problem and formulating the constraints to the SAT clauses provides another way to find the solution to this typical problem. The recent advancement in the development of SAT solvers has really provided an easy approach to find the truth values for a SAT formula. Thus, we have performed the formulations of the constraints of GCP into ALOC, AMOC and DCOL clauses. With our formulations, we are able to generate the SAT clauses in polynomial time. The total SAT clauses that are being generated with our formulations are | V | + | V |* k*(k-1) / 2 + (m*E).
Â
Keywords: SAT, Graph Coloring, Encodings, Clauses, Polynomial Time
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.