Topology Atlas | Conferences

Knots in the Triangle (Knots kNot in Washington)
April 29 - May 1, 2016
North Carolina State University
Raleigh NC, USA

Organizers
Valentina Harizanov (GWU), Jozef H. Przytycki (GWU), Yongwu Rong (GWU), Radmila Sazdanovic (NCSU), Alexander Shumakovitch (GWU), Hao Wu (GWU)

Conference Homepage


Counting Cycles in Directed Graphs
by
Thomas Riggs
George Washington University

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. This talk is

based on my senior thesis, which was done under the guidance of Professor Hao Wu of The George Washington

University.

Date received: April 12, 2016

Copyright © 2016 by the author(s). The author(s) of this work and the organizers of the conference have granted their consent to include this abstract in Topology Atlas. Document # cbmk-28.