Identifying codes and set cover problem

Graph theory is a research area that one of the most find practise. In this manner, after an optimization problem adapt to the graph theory, it can be solved via the identifying codes.In addition to this, the set cover problem is one of the problems can be applied to real life. A reduction between the covering problems and identifying codes have been studied in this thesis. We can transfer a problem that have been adapted one of these problems from one to another.We can summarize our work such following: Definitions about set theory, graph theory, complexity classes, identifying codes and set cover problems were given in sections 2-3-4-5. The reduction between the covering problems and identifying codes have been studied in 6. chapter. There are two structures that supply to pass from one to another problem in this chapter. In the next section applications about identifying code has been invastigated.