Implementasi Algoritma Edmonds Karp Dalam Pencarian Aliran Maksimum Pada Jaringan Listrik
Abstract
Keywords
Full Text:
PDFReferences
T. Farizal, “PENCARIAN ALIRAN MAKSIMUM DENGAN ALGORITMA FORD-FULKERSON (Studi Kasus pada Jaringan Listrik di Kota Tegal).†Universitas Negeri Semarang, 2013.
R. Munir, “Matematika Diskrit edisi ketiga,†Inform. Bandung, 2009.
J. Jek Siang, “Matematika Diskrit dan Aplikasinya Pada Ilmu Komputer,†Yogyakarta Penerbit Andi Yogyakarta, 2009.
J. G. Rosenstein and V. A. DeBellis, “The Leadership Program in Discrete Mathematics.,†Discret. Math. Sch., vol. 36, pp. 415–431, 1992.
U. Latifah, “Penerapan Algoritma Prim dan Kruskal pada Jaringan Distribusi Air PDAM Tirta Moedal Cabang Semarang Utara.†Universitas Negeri Semarang, 2014.
T. K. Dey, “Edmonds-Karp Algorithm (Advanced Algorithms (CSE 794)).†2009.
C. Jain and D. Garg, “Improved Edmond Karps Algorithm for Network Flow Problem,†Int. J. Comput. Appl., vol. 37, no. 01, p. 2012, 2012.
K. K. Mallick, A. R. Khan, M. M. Ahmed, M. S. Arefin, and M. S. Uddin, “Modified EDMONDS-KARP algorithm to solve maximum flow problems,†Open J. Appl. Sci., vol. 6, no. 2, pp. 131–140, 2016.
T. Everitt and M. Hutter, “Analytical results on the BFS vs. DFS algorithm selection problem. Part I: tree search,†in Australasian Joint Conference on Artificial Intelligence, 2015, pp. 157–165.
F. Halim, R. H. C. Yap, and Y. Wu, “A MapReduce-based maximum-flow algorithm for large small-world network graphs,†in 2011 31st International Conference on Distributed Computing Systems, 2011, pp. 192–202.
DOI: http://dx.doi.org/10.26555/konvergensi.v6i1.19543
Refbacks
- There are currently no refbacks.
View My Stats JIM