Abrori, M., & Yogyakarta, P. M. F. S. d. T. U. S. K. (2019). Problem of Maximum Matching in Non-Bipartite Graph Using Edmonds’ Cardinality Matching Algorithm and Its Applicationin the Battle of Britain Case. Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang.
Chicago Style CitationAbrori, Muchammad, and Prodi Matematika Fakultas Sains dan Teknologi UIN Sunan Kalijaga Yogyakarta. Problem of Maximum Matching in Non-Bipartite Graph Using Edmonds’ Cardinality Matching Algorithm and Its Applicationin the Battle of Britain Case. Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang, 2019.
MLA CitationAbrori, Muchammad, and Prodi Matematika Fakultas Sains dan Teknologi UIN Sunan Kalijaga Yogyakarta. Problem of Maximum Matching in Non-Bipartite Graph Using Edmonds’ Cardinality Matching Algorithm and Its Applicationin the Battle of Britain Case. Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang, 2019.