Undergraduate senior honor thesis defense

Speaker: Thomas Riggs
Time: Thursday, April 28, 1:00--2:00pm
Location: Corcoran 106
Title: Counting Cycles in Directed Graphs

Abstract:
In any directed graph, the cycle packing number is the maximum amount of edge disjoint directed cycles within the graph.  In my research, I developed an extension to the Macauly2 software package, which allows a user to input a directed graph and receive the cycle packing number.

Advisor: Professor H. Wu.