<html dir="ltr">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-9">
<style type="text/css" id="owaParaStyle"></style>
</head>
<body fpstyle="1" ocsi="0">
<div style="direction: ltr;font-family: Tahoma;color: #000000;font-size: 10pt;">
<div><span style="font-size: 13.3333330154419px;"><span style="font-size: 10pt; line-height: 15.3333320617676px; font-family: 'Segoe UI', sans-serif;">Sayin Liste Uyeleri,</span><br>
<br>
GTU Matematik Bölümü Genel Seminerleri kapsamında,<br>
10 Nisan Cuma günü saat 15:00'da </span><span style="font-size: 13.3199996948242px;">Emre KOLOTOGLU</span><br>
<span style="font-size: 13.3333330154419px;">(Yildiz Teknik Universitesi) bir seminer verecektir. Seminerin</span><br>
<span style="font-size: 13.3333330154419px;">detayları aşağıda olup tüm ilgilenenler davetlidir.</span><br>
<br>
<span style="font-size: 13.3333330154419px;">Saygılarımızla,</span></div>
<div style="font-size: 13.3333330154419px;"><br>
</div>
<div>
<div style="font-size: 13.3333330154419px;"><font style="font-size: 13.3333330154419px; font-family: Arial;"><span style="font-size: 13px;"><font face="Arial" size="1"><span style="font-size: 13.32px;"><font face="Arial,sans-serif" size="1" color="#222222"><span style="font-size: 12.78px; background-color: white;">Title: </span></font></span></font></span></font>Graph
Decompositions and Traffic Grooming in Optical Networks
<p class="MsoNormal" style="font-size: 13.3333330154419px;"><span lang="EN-GB"></span></p>
<font face="Arial" style="font-size: 13.3333330154419px;"><br>
<font color="#222222"><span style="font-size: 12.78px; background-color: white;">Abstract:</span><span style="background-color: white;"><font size="2"> </font></span></font></font><span style="font-size: 13px;"> </span></div>
<div style="font-size: 13.3333330154419px; margin-top: 14pt; margin-bottom: 14pt;">
<span style="font-size: 13.3333330154419px;">A G-design of order n is a decomposition of the complete graph on n vertices into edgedisjoint subgraphs isomorphic to G. Grooming uniform all-to-all traffic in optical (SONET or SDH) 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, and give some new results.</span><span style="font-size: 13px;"> </span></div>
<div style="font-size: 13.3333330154419px;"><font style="font-size: 13.3333330154419px; font-family: Arial;"><span style="font-size: 13px;"><font face="Arial" size="1"><span style="font-size: 13.32px;"><font face="Arial,sans-serif" size="1" color="#222222"><span style="font-size: 12.78px; background-color: white;"><br>
</span></font></span></font></span></font></div>
<div style="font-size: 13.3333330154419px;"><font style="font-size: 13.3333330154419px; font-family: Arial;"><span style="font-size: 13px;"><font face="Arial" size="1"><span style="font-size: 13.32px;"><font face="Arial,sans-serif" size="1" color="#222222"><span style="font-size: 12.78px; background-color: white;"><br>
</span></font></span></font></span></font></div>
<div style="font-size: 13.3333330154419px;"><font style="font-size: 13.3333330154419px; font-family: Arial;"><span style="font-size: 13px;"><font face="Arial" size="1"><span style="font-size: 13.32px;"><font face="Arial,sans-serif" size="1" color="#222222"><span style="font-size: 12.78px; background-color: white;"><br>
</span></font></span></font></span></font></div>
<div><span style="font-size: 13.3333330154419px;"><span style="font-size: 10pt; line-height: 15.3333320617676px; font-family: 'Segoe UI', sans-serif;">Dear all,</span><br>
<br>
There will be a seminar in Gebze Technical University (GTU) on 10th of<br>
April by </span><span style="font-size: 13.3199996948242px;">Emre KOLOTOGLU</span><span style="font-size: 13.3333330154419px;"> (Yildiz Teknik Uni) </span><br>
<span style="font-size: 13.3333330154419px;">Time and place: At 15:00 in Department of Mathematics,</span><br>
<span style="font-size: 13.3333330154419px;">Building I, Seminar room.</span></div>
</div>
<div style="font-size: 13.3333330154419px;"><br>
</div>
<div style="font-size: 13.3333330154419px;">
<div style="font-size: 13.3333330154419px;">
<div style="font-size: 13.3333330154419px;">
<div style="font-size: 13.3333330154419px;">
<div style="font-size: 13.3333330154419px;"><font style="font-size: 13.3333330154419px; font-family: Arial;"><span style="font-size: 13px;"><font face="Arial" size="1"><span style="font-size: 13.32px;"><font face="Arial,sans-serif" size="1" color="#222222"><span style="font-size: 12.78px; background-color: white;">Title: </span></font></span></font></span></font>Graph
Decompositions and Traffic Grooming in Optical Networks
<p class="MsoNormal" style="font-size: 13.3333330154419px;"><span lang="EN-GB"></span></p>
<font face="Arial" style="font-size: 13.3333330154419px;"><br>
<font color="#222222"><span style="font-size: 12.78px; background-color: white;">Abstract:</span><span style="background-color: white;"><font size="2"> </font></span></font></font><span style="font-size: 13px;"> </span></div>
<div style="font-size: 13.3333330154419px; margin-top: 14pt; margin-bottom: 14pt;">
<span style="font-size: 13.3333330154419px;">A G-design of order n is a decomposition of the complete graph on n vertices into edgedisjoint subgraphs isomorphic to G. Grooming uniform all-to-all traffic in optical (SONET or SDH) 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, and give some new results.</span><span style="font-size: 13px;"> </span></div>
<div style="font-size: 13.3333330154419px;"><font style="font-size: 13.3333330154419px; font-family: Arial;"><span style="font-size: 13px;"><font face="Arial" size="1"><span style="font-size: 13.32px;"><font face="Arial,sans-serif" size="1" color="#222222"><span style="font-size: 12.78px; background-color: white;"><br>
</span></font></span></font></span></font></div>
</div>
</div>
</div>
</div>
<div>
<div style="font-family:Tahoma; font-size:13px">
<div>
<div></div>
</div>
</div>
</div>
</div>
</body>
</html>