Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : Indonesian Journal of Applied Mathematics

Penerapan Algoritma Batchelor-Wilkins dalam Pengklasteran Graf Christyan Tamaro Nadeak
Indonesian Journal of Applied Mathematics Vol 3 No 1 (2023): Indonesian Journal of Applied Mathematics Vol. 3 No. 1 July Chapter
Publisher : Lembaga Penelitian dan Pengabdian Masyarakat (LPPM), Institut Teknologi Sumatera, Lampung Selatan, Lampung, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35472/indojam.v3i1.1259

Abstract

Batchelor-Wilkins Algorithm is a simple and heuristic clustering algorithm used when the number of classes is unknown. In this paper we will use Batchelor-Wilkins algorithm in graph clustering, specifically a Banana Tree Graph B(n,k), a graph obtained by connecting one leaf of each of n copies of a complete bipartite graph K_{1,k-1} to a single root vertex.