MASALAH PARTISI GRAF BOTTLENECK (BOTTLENECK GRAPH PARTITION PROBLEM)

• المؤلف الرئيسي: Perpustakaan UGM, i-lib
• التنسيق: مقال NonPeerReviewed
• منشور في: [Yogyakarta] : Universitas Gadjah Mada 2001
• الموضوعات: Jurnal i-lib UGM
• الوصول للمادة أونلاين: https://repository.ugm.ac.id/24734/; http://i-lib.ugm.ac.id/jurnal/download.php?dataId=7712

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...