Arşiv ve Dokümantasyon Merkezi
Dijital Arşivi

Konu "Graph theory." için M.S. Theses listeleme

Konu "Graph theory." için M.S. Theses listeleme

Sırala: Sıra: Sonuçlar:

  • Akdemir, Ahu. (Thesis (M.S.)-Bogazici University. Institute for Graduate Studies in Science and Engineering, 2012., 2012.)
    Ramsey number, R(a; b), denotes the smallest positive integer n such that, among any n people, there exist a people who know each other or b people who do not know each other. R(a; b) values are known for small a and b ...
  • Düzgün, Ahmet Çağrı. (Thesis (M.A.) - Bogazici University. Institute for Graduate Studies in the Social Sciences, 2017., 2017.)
    Maximum Stable Set (MSS) problem is a well-known problem in graph theory. It is an NP-hard problem in general graphs and it has been extensively studied due to both its theoretical and practical importance. On the other ...
  • Çalık, Ayberk. (Thesis (M.S.)-Bogazici University. Institute for Graduate Studies in Science and Engineering, 2013., 2013.)
    In the classical graph coloring problem, the vertices of a given graph are colored such that no two adjacent vertices take the same color with the objective of coloring the whole graph with the minimum number of colors. ...

Dijital Arşivde Ara


Göz at

Hesabım