Heuristic to Reduce the Complexity of Complete Bipartite Graphs To . . .

Abstract

A maximum weighted matching for bipartite graphs G = (A [ B; E) can be found by using the algorithm of Edmonds and Karp [1] with a Fibonacci Heap and a modified Dijkstra in O(nm + n²log n) time where n is the number of nodes and m the number of edges. For the case that |A| = |B| the number of edges is n² therefore the complexity is O(n³). In this pape