Astuti , Yani Parti (1998) Algoritma matching bobot maskimum dalam graph bipartit komplit berboto. Undergraduate thesis, FMIPA Undip.
| PDF 20Kb | |
| PDF 327Kb | |
| PDF 223Kb | |
| PDF 247Kb | |
| PDF 517Kb | |
PDF Restricted to Repository staff only 733Kb | ||
| PDF 208Kb | |
| PDF 213Kb | |
PDF Restricted to Repository staff only 1548Kb |
Abstract
ABSTRAK Suatu matching dalam graph G adalah subgraph 1-regular pada G yang disebabkan oleh kumpulan dart pasangan garis yang tidak adjacent. Suatu matching merupakan matching maksimum bila matching tersebut mempunyai harga pokok maksimum. Matching dalam graph bipartit merupakan matching maksimum apabila tidak adanya path perluasart yang berkenaan dengan matching tersebut. Matching yang mempunyai bobot maksimum disebut matching bobot maksimum. Matching bobot maksimum dalam graph bipartit komplit berbobot diperoleh dengan mencari matching maksimum dalam subgraph pada graph bipartit komplit berbobot, kemudian dibangun sampai didapatkan matching perfek atau setiap titik dalam V merupakan titik matched. A matching in a graph G is a 1-regular subgraph of G, that is, a subgraph induced _by a collection of pairwise nonadjacent edges. A matching is called maximum matching if the matching have maximum cardinality. A matching in a bipartite graphs is a maximum matching if there exists no augmenting path. A matching in which the sum of the weights of maximum its edges is called maximum weight matching. A maximum weight matching in weighted complete bipartite graphs is got to find maximum matching in subgraph to weighted complete bipartite graphs, further its construct to arrived is got perfec matching or each vertex in V is matched vertex.
Item Type: | Thesis (Undergraduate) |
---|---|
Subjects: | Q Science > QA Mathematics |
Divisions: | Faculty of Science and Mathematics > Department of Mathematics |
ID Code: | 31767 |
Deposited By: | Mr UPT Perpus 2 |
Deposited On: | 24 Nov 2011 15:11 |
Last Modified: | 24 Nov 2011 15:11 |
Repository Staff Only: item control page