O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
Journal of Algorithms
Fast algorithms for bipartite network flow
SIAM Journal on Computing
Faster scaling algorithms for network problems
SIAM Journal on Computing
Introduction to algorithms
On query languages for the P-string data model
Information modelling and knowledge bases
Improved Algorithms for Bipartite Network Flow
SIAM Journal on Computing
Sparse Dynamic Programming for Evolutionary-Tree Comparison
SIAM Journal on Computing
Tree Contractions and Evolutionary Trees
SIAM Journal on Computing
An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
SIAM Journal on Computing
CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
Computing the Agreement of Trees with Bounded Degrees
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
| Hi-index | 0.00 |
This paper is concerned with maximum weight matchings of bipartite graphs. We show how to speed up the existing matching algorithms when the input graphs are node unbalanced or weight unbalanced. Based on these improved matching algorithms, we can solve efficiently a new matching problem called the hierarchical bipartite matching problem, and thus obtain a simple and faster algoirthm for finding the maximum agreement subtree of two labeled trees. The significance of our subtree algorithm lies in the fact that it matches or outperforms all previously known subtree algorithms that were designed for two special cases of labeled trees, namely, uniformly labeled trees and evolutionary trees.