Digilib Perpustakaan Universitas Riau

  • Beranda
  • Informasi
  • Berita
  • Bantuan
  • Pustakawan
  • Pilih Bahasa :
    Bahasa Arab Bahasa Bengal Bahasa Brazil Portugis Bahasa Inggris Bahasa Spanyol Bahasa Jerman Bahasa Indonesia Bahasa Jepang Bahasa Melayu Bahasa Persia Bahasa Rusia Bahasa Thailand Bahasa Turki Bahasa Urdu

Pencarian berdasarkan :

SEMUA Pengarang Subjek ISBN/ISSN Pencarian Spesifik

Pencarian terakhir:

{{tmpObj[k].text}}
Image of Analisis Perbandingan Algoritma Backtracking, Greedy, Dan Welch-Powell Dalam Menentukan Bilangan Kromatik Pada Graf Modifikasi Adenovirus
Penanda Bagikan

CD Skripsi

Analisis Perbandingan Algoritma Backtracking, Greedy, Dan Welch-Powell Dalam Menentukan Bilangan Kromatik Pada Graf Modifikasi Adenovirus

Aulia Azzahra Amran / 2103111082 - Nama Orang;

Adenovirus is a DNA virus that causes infections in the upper or lower respira- tory tract, pharynx, gastrointestinal tract, and conjunctiva. Let G = (AVn) be the modified adenovirus graph, which is constructed from molecular biology da- ta, where V (G) is the set of vertices representing genes of the DNA virus, DNA segments, and their variants, while E(G) is the set of edges representing over- lapping interactions or conflicts between segments. This final project discusses vertex coloring on the modified adenovirus graph (AVn) such that every two adjacent vertices are assigned different colors. The chromatic number is the mi- nimum number of colors used to solve the vertex coloring problem on the graph G and is denoted by χ(G). To determine the chromatic number of the modi- fied adenovirus graph (AVn), three coloring algorithms are applied, specifically the backtracking, greedy, and Welch-Powell algorithms, making this research a collaboration across the fields of mathematics, biology, and computation. The results show that all three algorithms can solve the vertex coloring problem with χ(AVn) = 3 for n = 4, 6, 8, 10, 12 and χ(AVn) = 4 for n = 5, 7, 9, 11. Based on the analysis of these three algorithms, it can be concluded that in terms of execution time, the backtracking algorithm is less efficient for determining the chromatic number of graphs with a larger number of vertices compared to the greedy and Welch-Powell algorithms.
Keywords: Vertex coloring, chromatic number, adenovirus modified graph, backtracking algorithm, greedy algorithm, Welch-Powell algorithm


Ketersediaan
#
Perpustakaan Universitas Riau 2103111082
2103111082
Tersedia
Informasi Detail
Judul Seri
-
No. Panggil
2103111082
Penerbit
Pekanbaru : Universitas Riau FMIPA Matematika., 2025
Deskripsi Fisik
-
Bahasa
Indonesia
ISBN/ISSN
-
Klasifikasi
2103111082
Tipe Isi
-
Tipe Media
-
Tipe Pembawa
-
Edisi
-
Subjek
MATEMATIKA
Info Detail Spesifik
-
Pernyataan Tanggungjawab
Mutia
Versi lain/terkait

Tidak tersedia versi lain

Lampiran Berkas
  • COVER
  • DAFTAR ISI
  • ABSTRAK
  • BAB 1 PENDAHULUAN
  • BAB 2 TEORI PENDUKUNG
  • BAB 3. ANALISIS PERBANDINGAN ALGORITMA BACKTRACKING, GREEDY, DAN WELCH-POWELL DALAM MENENTUKAN BILANGAN KROMATIK PADA GRAF MODIFIKASI ADENOVIRUS
  • BAB 4 KESIMPULAN DAN SARAN
  • DAFTAR PUSTAKA
Komentar

Anda harus masuk sebelum memberikan komentar

Digilib Perpustakaan Universitas Riau
  • Informasi
  • Layanan
  • Pustakawan
  • Area Anggota

Tentang Kami

As a complete Library Management System, SLiMS (Senayan Library Management System) has many features that will help libraries and librarians to do their job easily and quickly. Follow this link to show some features provided by SLiMS.

Cari

masukkan satu atau lebih kata kunci dari judul, pengarang, atau subjek

Donasi untuk SLiMS Kontribusi untuk SLiMS?

© 2025 — Senayan Developer Community

Ditenagai oleh SLiMS
Pilih subjek yang menarik bagi Anda
  • Karya Umum
  • Filsafat
  • Agama
  • Ilmu-ilmu Sosial
  • Bahasa
  • Ilmu-ilmu Murni
  • Ilmu-ilmu Terapan
  • Kesenian, Hiburan, dan Olahraga
  • Kesusastraan
  • Geografi dan Sejarah
Icons made by Freepik from www.flaticon.com
Pencarian Spesifik
Kemana ingin Anda bagikan?