Efficient Cycle Removal from a Directed Graph

 

Seraphina Qi
Wake Forest University Computer Science Honors Project

Wednesday, December 5 2018 @ 4:00 pm
Manchester Hall 024

This paper introduces a new algorithm, SCR, which efficiently removed edges from a directed graph ultimately resulting in a directed acyclic graph. Loizou’s cycle basis algorithm is the motivation for SCR. The BCHC algorithm, created and applied by the Wake Forest Biomodeling Group to create gene interaction models, will benefit significantly when SCR in incorporated.