Vertex Coloring of A Graph
tarafından
Bacak, Gökşen.
Başlık
:
Vertex Coloring of A Graph
Yazar
:
Bacak, Gökşen.
Yazar Ek Girişi
:
Bacak, Gökşen.
Yayın Bilgileri
:
[s.l.] : [s.n.], 2004.
Fiziksel Tanımlama
:
vii, 39 leaves. : ill. + 1 computer laser optical disc.
Özet
:
Vertex coloring is the following optimization problem; given a graph, how many colors are required to color its vertices in such a way that no two adjacent vertices receive the same color? The required number of colors is called the chromatic number of G and is denoted by (G). In this thesis, we reviewed the vertex coloring concepts and theorems. The package ColorG which we have improved has many functions for dealing with graph coloring. This package uses a heuristic method due to Brelaz to color the graph so that adjacent vertices have distinct colors.
Konu Başlığı
:
Graph coloring
Graph theory
Mathematica (Computer program language)
Yazar Ek Girişi
:
Ufuktepe, Ünal
Tüzel Kişi Ek Girişi
:
İzmir Institute of Technology. Mathematics.
Tek Biçim Eser Adı
:
Thesis (Master)--İzmir Institute of Technology: Mathematics.
İzmir Institute of Technology: Mathematics--Thesis (Master).
Elektronik Erişim
:
Library | Materyal Türü | Demirbaş Numarası | Yer Numarası | Durumu/İade Tarihi |
---|
IYTE Library | Tez | T000416 | QA166.247.B11 2004 C.1 | Tez Koleksiyonu |