The vertex cover problem is a classical graph optimization problem which remains intractable even for cubic graphs and planar graphs with maximum degree at most three. In this paper, the exact ...

In this paper, described depth first search algorithm being implemented on line maze solver robot. Right hand rule will be used to select the turn priority. Some mazes will be used to test the ...