Combinatorial Optimization: Mutual Relations among Graph Algorithms

Abstract:- The Theory of Graphs is a wonderful, practical discipline. Informatics has played a big part in its development, and these two fields are strongly interconnected. This can, perhaps, mainly be seen in the design of computer algorithms. On the one hand, there are many methods which can be used for solving the same problem, while on the other hand, using effective modifications of one algorithm, we can devise methods of solving various other tasks. To educate students in the area close connected with Graph Theory and Computer Science, called as Combinatorial or Discrete Optimization, it is important to make them familiar with certain algorithms in contexts to be able to get deeper into each problem and entirely understand it. In the paper we present just a few ideas that have proved successful in teaching and learning this quite young part of mathematics