Browsing Skripsi Sarjana by Keyword "Matching Maksimum"
Now showing items 1-1 of 1
(Universitas Sumatera Utara, 2019)Matching is a problem that pairs exactly one. In graphs theory, the maximum matching problem is called a bipartite graphs. One application of bipartite graphs is on assignment problems that look for maximum weight from the ...