Show simple item record

dc.contributor.advisorAykanat, Cevdet
dc.contributor.authorAtmaca, Abdullah
dc.date.accessioned2018-08-29T06:17:06Z
dc.date.available2018-08-29T06:17:06Z
dc.date.copyright2018-08
dc.date.issued2018-08
dc.date.submitted2018-08-14
dc.identifier.urihttp://hdl.handle.net/11693/47752
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (Ph.D.): Bilkent University, Department of Computer Engineering, İhsan Doğramacı Bilkent University, 2018.en_US
dc.descriptionIncludes bibliographical references (leaves 60-63).en_US
dc.description.abstractIn the first part of this dissertation, we focus on graph problems that arise in call models. Such models are used to study the combinatorial properties of certain types of calls that include unicast, multicast, and bicast interconnections. Here we focus on bicast calls, and provide closed-form expressions for the number of unlabeled bicast calls when either the number of callers or number of receivers is fixed to 2 or 3. We then obtain lower and upper bounds on the number of such calls by solving an open problem in graph theory, namely counting the number of unlabeled bipartite graphs. Next, these results are extended to left (right) set labeled and set labeled bipartite graphs. In the second part of the dissertation, we focus on wiring and routing problems for one-sided, binary tree switching networks. Specifically, we reduce the O(n) time complexity of the routing algorithm for the one-sided, binary tree switching networks to O(lg n). We also present a new wiring algorithm for one-sided, binary tree switching networks. Finally, an algorithm is presented to locate the cluster in which the terminals of the corresponding one-sided binary tree switching network are paired. The time complexity of this algorithm is shown to be O(lg n).en_US
dc.description.statementofresponsibilityby Abdullah Atmaca.en_US
dc.format.extentx, 74 leaves ; 30 cm.en_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectBipartite Graphsen_US
dc.subjectPolya’s Counting Theoremen_US
dc.subjectCycle İndex Polynomialen_US
dc.subjectSwitching Networksen_US
dc.subjectCall Modelsen_US
dc.titleGraph problems in call models and switching networksen_US
dc.title.alternativeÇağrı modelleri ve anahtarlama ağlarında çizge problemlerien_US
dc.typeThesisen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreePh.D.en_US
dc.identifier.itemidB158770


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record