49 citations · 49 across the 2 of their papers we have counts for
Showing 2000 · cs.DSShow all
2 papers · 2 filters
cs.DS2000
Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets
Miklos Csuros, Ming-Yang Kao
We give a greedy learning algorithm for reconstructing an evolutionary tree based on a certain harmonic average on triplets of terminal taxa. After the pairwise distances between t…
cs.DS2000
A Decomposition Theorem for Maximum Weight Bipartite Matchings
Ming-Yang Kao, Tak-Wah Lam, Wing-Kin Sung +1
Let G be a bipartite graph with positive integer weights on the edges and without isolated nodes. Let n, N and W be the node count, the largest edge weight and the total weight of…