Koç University, Mathematics Seminar

Date & Time: Thursday, November 27, 17:30-18:30

Place: SCI-103

Speaker: Emre Kolotoğlu (Yıldız Technical University)

Title: Graph Decompositions vs. Traffic Grooming in Optical Networks

Abstract: A G-design of order n is a decomposition of the complete graph on n vertices into edge-disjoint subgraphs isomorphic to G. Grooming uniform all-to-all trac in optical (SONET) ring networks with grooming ratio C requires the determination of a decomposition of the complete graph on n vertices into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. In this talk, I will talk about the connection between graph decompositions and optimal groomings, introduce some construction techniques, and give some new results.

About the Speaker: Emre Kolotoğlu got his bachelors degree in computer engineering from Bilkent University in 2005, and masters degree in mathematics from Koç University in 2007. He completed his PhD in mathematics at Florida Atlantic University in 2013. He is currently an assistant professor in the department of mathematics at Yıldız Technical University. He is interested in Design Theory and related areas such as Graph Theory, Coding Theory, and Algebraic Combinatorics. His main research involves solving combinatorial problems by means of algebraic methods.