PENENTUAN MATCHING MAKSIMUM PADA GRAF BIPARTIT BERBOBOT MENGGUNAKAN METODE HUNGARIAN
(1) Jurusan Matematika, Universitas Islam Negeri Sunan Kalijaga, Jln. Adi Sucipto no. 1, Jogjakarta
(2) Jurusan Matematika, Universitas Islam Negeri Sunan Kalijaga, Jln. Adi Sucipto no. 1, Jogjakarta
(*) Corresponding Author
DOI: https://doi.org/10.23917/jiti.v11i1.984
Abstract
Keywords
Full Text:
PDF (Bahasa Indonesia)References
Anton, Howard, 1987, Aljabar Linear Elementer: Jakarta.
Berge, Coulde, 1970, Graph and Hypergraph, Dunod: Netherlands.
Bondy, J.A dan Murty, U.S.R., 1976, Graph Theory with Applications, Mac Millan Press: New York.
Chartrand, Gary dan Oellermann, Ortrud, 1993, Applied and Algoritmic Graph Theory, Mc Graw Hill International Edition: New York.
Gondran, M. dan Minoux, M., 1984, Graphs and Algorithms. John Wiley & Sons, Ltd.: Chichester, Inggris.
Kocay, William dan Kreher, Donald, 2005, Graph Theory and Optimization, Chapman & Hall / CRC.
Magun, J., 2000. Greedy Matching Algorithms, an Experimental Study. Schweizerischer Nationalfond, Grant NF 2000-422 44.94. Zűrich, Switzerland.
Venkateswaran, R., Obranivic, Z., Raghavendra, C.S., 1993. Cooperative Genetic for Optimization Problem in Distributed Computer System. Technical report TR-EECS-93-018. School of EECS. Washington State University.
Wibisono, Samuel, 2008, Matematika Diskrit. Edisi Kedua, Graha Ilmu: Yogyakarta.
Article Metrics
Abstract view(s): 1255 time(s)PDF (Bahasa Indonesia): 3326 time(s)
Refbacks
- There are currently no refbacks.