Introduction to algorithms
Clique partitions, graph compression and speeding-up algorithms
Journal of Computer and System Sciences
Fast comparison of evolutionary trees
Information and Computation
Sparse Dynamic Programming for Evolutionary-Tree Comparison
SIAM Journal on Computing
General techniques for comparing unrooted evolutionary trees
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Tree Contractions and Evolutionary Trees
SIAM Journal on Computing
An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees
SIAM Journal on Computing
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Computing the Agreement of Trees with Bounded Degrees
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Computing unrooted maximum subtrees in sub-quartic time
Nordic Journal of Computing
Graph Theory With Applications
Graph Theory With Applications
Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A Faster and Unifying Algorithm for Comparing Trees
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees
Information Processing Letters
Maximum agreement and compatible supertrees
Journal of Discrete Algorithms
Faster dynamic matchings and vertex connectivity
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Linear time 3-approximation for the MAST problem
ACM Transactions on Algorithms (TALG)
Near approximation of maximum weight matching through efficient weight reduction
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
On the approximation of computing evolutionary trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Weighted bipartite matching in matrix multiplication time
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
An efficient reduction from constrained to unconstrained maximum agreement subtree
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
An O(nlog n)-time algorithm for the maximum constrained agreement subtree problem for binary trees
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.00 |
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).