Showing papers by "Wing-Kin Sung published in 1999"

A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees

Abstract: Let G be a bipartite graph with positive integer weights on the edges and without isolated nodes. Let n and W be the node count and the total weight of G. We present a new decomposition theorem for maximum weight bipartite matchings and use it to design an O(?nW)-time algorithm for computing a maximum weight matching of G. This algorithm bridges a long-standing gap between the best known time complexity of computing a maximum weight matching and that of computing a maximum cardinality matching. Given G and a maximum weight matching of G, we can further compute the weight of a maximum weight matching of G - {u} for all nodes u in O(W) time. As immediate applications of these algorithms, the best known time complexity of computing a maximum agreement subtree of two l-leaf rooted or unrooted evolutionary trees is reduced from O(l1.5 log l) to O(l1.5).