A New Reduction from 3SAT to Graph K-Colorability for Frequency Assignment Problem

@inproceedings{Sharma2012ANR,
  title={A New Reduction from 3SAT to Graph K-Colorability for Frequency Assignment Problem},
  author={Prakash C. Sharma},
  year={2012}
}
The satisfiability problem (SAT) is one of the most prominent problems in theoretical computer science for understanding of the fundamentals of computation. It is first known NP-Complete problem. Graph k-Colorability (for k ? 3) Problem (GCP) is also an well known NP-Complete problem. We can reduce any NP-Complete problem to/from SAT. Reduction from… CONTINUE READING