199 search results - page 2 / 40 » Fast Algorithms for Computing Tree LCS |
CN
2008
13 years 4 months ago
2008
WEA
2010
Springer
13 years 11 months ago
2010
Springer
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
STOC
2003
ACM
14 years 4 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
ICCV
2001
IEEE
14 years 6 months ago
2001
IEEE
JPDC
2006
13 years 4 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...