Solving problems on graphs using elimination algorithms

This diploma thesis deals with solving problems in graphs using elimination algorithms. It contains theoretical basis and experimental work. We compare solving of selected problems using greedy and elimination algorithms. They were tested on dominating set, graph coloring and vertex cover problems. In this thesis we present the problems, the implementations and the results of the comparison between them