Masalah Partisi Graf Bottleneck
| Main Authors: | Roswita, Mania, Widodo, |
|---|---|
| Format: | Thesis NonPeerReviewed application/pdf |
| Terbitan: |
, 2001
|
| Subjects: | |
| Online Access: |
http://eprints.uns.ac.id/858/1/1952062819830320015.pdf http://eprints.uns.ac.id/858/ |
Daftar Isi:
- The Bottleneck graph partition peoblem is a pertition of the vertices of an undirect edge weigthted graph into two equally vertices sized sets, which are graph components, such that the maximum edge weight in the cut separing the two sets becomes minimum. In this thesis, the problem was solved by an optimum algorithm with running time (m+n3 log n),where n is the number of vertices and m is the number of edges in the graph. This algorithm based on binary search tree using greedy method on prim's algoithm. On validation the random graph is used for the computer's program. Keywords : graph partition, bottleneck, greedy method, prim's algorithm