6 search results - page 2 / 2 » Approximating the Maximum Isomorphic Agreement Subtree Is Ha... |
STACS
1999
Springer
13 years 10 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...