How to Search in the Right Direction

Graph searches are important concepts of algorithmic graph theory. Besides their usage as subroutines, these algorithms have themselves become an object of study in recent years. Several researchers considered questions about the construction of search orderings with special properties. These properties include the end vertices of the search orderings as well as the spanning trees that are induced by them. In this talk, we give an overview of these questions and the known complexity results. Furthermore, we present new problems that combine the end vertices and the search trees.

Regardless of whether you have a lifelong love of mathematics or are simply curious about the subject, we invite you to join us for this engaging and thought-provoking discussion.

The seminar will also be held virtually via Zoom.

Join the Zoom Meeting HERE!

Feel free to invite any friends or colleagues who may be interested.

We look forward to (virtually) sharing the passion for math with you!