Junita Damanik, Selti
(2007)
*PEWARNAAN SIS GRAF DENGAN MENGGUNAKAN ALGORITMA VIZING.*
Diploma thesis, Universitas Komputer Indonesia.

## Abstract

The development of knowledge for finishing a problem which can be handled by an efficient algorithm is getting wider. The kind of problem can be from easy until complicated problem, like graph coloring. Related to the complication of that problem, from many kind of algorithms, it needs to know which one of algorithms that is more efficient. Graph coloring problem is one of the concept in undirected graph, how to colour at every edge of undirected graph so that every edge connected with the two vertex that giving a different color. Proper coloring with the minimum number of color, in general, is a difficult task, this problem is one problem in class of NP-complete that is hard to be solved. One method to solve the graph coloring problem is using vizing algorithm. Implementation of vizing algorithm where edge colored in either maximum degree of the graph and maximum degree + 1 and complex time of vizing algorithm is O(mn). For this goal give solution to graph coloring problem.

Item Type: | Thesis (Diploma) |
---|---|

Subjects: | S1-Final Project > Fakultas Teknik Dan Ilmu Komputer > Teknik Informatika > 2007 |

Divisions: | Universitas Komputer Indonesia > Fakultas Teknik dan Ilmu Komputer Universitas Komputer Indonesia > Fakultas Teknik dan Ilmu Komputer > Teknik Informatika (S1) |

Depositing User: | Admin Repository |

Date Deposited: | 16 Nov 2016 07:46 |

Last Modified: | 16 Nov 2016 07:46 |

URI: | http://repository.unikom.ac.id/id/eprint/10441 |

### Actions (login required)

View Item |