MASALAH PARTISI GRAF BOTTLENECK (BOTTLENECK GRAPH PARTITION PROBLEM)
ABSTRACT The Bottleneck graph partition problem is a partition of the vertices of an undirected edge weighted 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 so...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Article NonPeerReviewed |
| 出版: |
[Yogyakarta] : Universitas Gadjah Mada
2001
|
| 主題: | |
| 在線閱讀: | https://repository.ugm.ac.id/24734/ http://i-lib.ugm.ac.id/jurnal/download.php?dataId=7712 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| id |
id-ugm-repo.24734 |
|---|---|
| record_format |
dspace |
| spelling |
id-ugm-repo.247342014-06-18T00:32:51Z https://repository.ugm.ac.id/24734/ MASALAH PARTISI GRAF BOTTLENECK (BOTTLENECK GRAPH PARTITION PROBLEM) Perpustakaan UGM, i-lib Jurnal i-lib UGM ABSTRACT The Bottleneck graph partition problem is a partition of the vertices of an undirected edge weighted 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 0(m+n3logn), 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 algorithm. On validation the random graph is used for the computer's program. Keywords : graph partition, bottleneck, greedy method, prim's algorithm [Yogyakarta] : Universitas Gadjah Mada 2001 Article NonPeerReviewed Perpustakaan UGM, i-lib (2001) MASALAH PARTISI GRAF BOTTLENECK (BOTTLENECK GRAPH PARTITION PROBLEM). Jurnal i-lib UGM. http://i-lib.ugm.ac.id/jurnal/download.php?dataId=7712 |
| institution |
Universitas Gadjah Mada |
| building |
UGM Library |
| country |
Indonesia |
| collection |
Repository Civitas UGM |
| topic |
Jurnal i-lib UGM |
| spellingShingle |
Jurnal i-lib UGM Perpustakaan UGM, i-lib MASALAH PARTISI GRAF BOTTLENECK (BOTTLENECK GRAPH PARTITION PROBLEM) |
| description |
ABSTRACT
The Bottleneck graph partition problem is a partition of the vertices of an undirected edge weighted 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 0(m+n3logn), 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 algorithm. On validation the random graph is used for the computer's program.
Keywords : graph partition, bottleneck, greedy method, prim's algorithm |
| format |
Article NonPeerReviewed |
| author |
Perpustakaan UGM, i-lib |
| author_facet |
Perpustakaan UGM, i-lib |
| author_sort |
Perpustakaan UGM, i-lib |
| title |
MASALAH PARTISI GRAF BOTTLENECK (BOTTLENECK GRAPH PARTITION PROBLEM) |
| title_short |
MASALAH PARTISI GRAF BOTTLENECK (BOTTLENECK GRAPH PARTITION PROBLEM) |
| title_full |
MASALAH PARTISI GRAF BOTTLENECK (BOTTLENECK GRAPH PARTITION PROBLEM) |
| title_fullStr |
MASALAH PARTISI GRAF BOTTLENECK (BOTTLENECK GRAPH PARTITION PROBLEM) |
| title_full_unstemmed |
MASALAH PARTISI GRAF BOTTLENECK (BOTTLENECK GRAPH PARTITION PROBLEM) |
| title_sort |
masalah partisi graf bottleneck (bottleneck graph partition problem) |
| publisher |
[Yogyakarta] : Universitas Gadjah Mada |
| publishDate |
2001 |
| url |
https://repository.ugm.ac.id/24734/ http://i-lib.ugm.ac.id/jurnal/download.php?dataId=7712 |
| _version_ |
1681218452216348672 |