Graph Algorithms in mutual Contexts
Eva Milková, Antonín Slabý · 2008
Mathematics belongs to the oldest science however the area known as Combinatorial or Discrete Optimization close connected with Graph Theory and Computer Science is quite yang. To educate students in this area it is important to meet them familiar with combinatorial algorithms in contexts to be able to get deeper into each problem and entirely understand it. This paper illustrates several algorithms solving the known problems on graphs and emphasizes different approaches to the solution of the same problem on the one hand and mutual relationships among methods solving various problems on the other hand.