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 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Universitas Gadjah Mada |