Skip to Main content

Traversability and the Bee Algorithm - Daniel Cevallos

Wednesday, April 3, 2019 12 p.m. Free
Mathematics Seminar

Traversability is a broad concept of graphs and how to get around them. The idea of Traversability is to get around the graph in as few steps as possible, without repeating a step. If you can do this, then the graph is considered traversable. If a graph is traversable, then it can be tested to see if an Euler Path or Circuit can be found. The more complicated the graph gets, the harder it is on the human mind. Thus, the Bee Algorithm was written. The concept of the Bee Algorithm is similar to how bee’s get their food from food sources. This allows graphs with 120+ vertices to be solved very quickly. To understand this algorithm, we will recall Traversability and how bee’s get their food from food sources. Prior knowledge of Traversability will be helpful, but not required.

Location

Mathematics-Computer Science Building, 210