Munarsih, Munarsih (2008) PENENTUAN MATCHING MAKSIMUM PADA GRAPH BIPARTISI. Other thesis, University of Muhammadiyah Malang.
Download (51kB) | Preview
The intention solution determination of maximum matching at this graph bipartit is to determine maximum result at assigment problem which formed in graph bipartit tagg is later searched by maximum matching of him, and also finish the of assigment problem without the altering of in the form of graph beforehand and compare result of him. In solution of this problem, calculation at graph bipartit to determine maximum matching of him use method of augmenting path and assigment problem using method of hungarian, and also comparison both of method. Maximum Matching can be found by using method of augmenting path with step look for free dots at graph bipartit, then from free dots with lable most is maximum formed by augmenting path, seeking of maximum matching desisting is otherwise found again aughmenting path which is respech to matching. As for example of applying of maximum matching at graph bipartit tagg that is to finish the assigment problem. Method of Hungarian can be used to solve assignation problem through step initially that is formed in the form of matrix, and to test the him of by using technique mark with lines cover zero that is made plump line or level off to close all zero but with many possible minimum lineses. If many lines of close zero equal to n (matrix measure are n x n) hence tables have optimal. Result of solving of assignation problem with method of augmenting path and method of hungarian have is same maximum result.
|Item Type:||Thesis (Other)|
|Subjects:||L Education > L Education (General)|
|Divisions:||Faculty of Teacher Training and Education > Department of Mathematics and Computing|
|Depositing User:||Anggit Aldila|
|Date Deposited:||19 May 2012 03:16|
|Last Modified:||19 May 2012 03:16|
Actions (login required)