Skip to content

Improvements to Signed Graph Problems

Tony RodriguezTony Rodriguez
Graduate Student
UT Industrial & Systems Engineering Department
January 29, 2016
2:30-3:30pm JDT410

Signed graphs have various applications, ranging from analyzing social situations, portfolio risk hedging, and clustering data. Many of these applications rely on balancing the corresponding signed graph. This talk will focus on exact methods to accomplish this by reducing the size of the signed graph, and by decomposing the signed graph into smaller instances. The results and effects of these approaches will be given for some data-inspired graphs as well as random instances to show that these approaches give high-quality solutions.

Tony Rodriguez is a graduate student at the University of Tennessee-Knoxville in the Industrial Engineering department. Before attending UTK, he was a student at East Tennessee State University, where received his MS in Mathematics in 2014 and his BS in Mathematics in 2012. Tony’s past research experiences have focused primarily on graph theory, particularly domination and variants thereof. His current research interests include graph theory, symmetry detection, and integer programming.

The flagship campus of the University of Tennessee System and partner in the Tennessee Transfer Pathway.