Austin Ulrigg

Austin Ulrigg

Undergraduate

An Efficient Genus Algorithm Based on Graph Rotations

less than 1 minute read

Published:

With Alexander Metzger I co-authored this paper about an algorithm which, for an arbitrary graph (G) with (n) vertices, this algorithm determines the orientable genus in (\mathcal{O}\left(\frac{2^{n^2+3n}}{n^{n+1}}\right)) steps. You can access the paper here.

If you have trouble viewing the paper, you can download it here:

Download Guide

You May Also Enjoy

Pearls In Graph Theory Solution Guide

less than 1 minute read

Published:

This solution guide is designed to supplement your learning by providing clarifications and problem-solving techniques. Please use it responsibly. Do not copy or plagiarize the solutions; instead, use them to check your work and enhance your understanding. Engaging with the material independently is essential for your learning and academic integrity.