Ling-Ju Hung

An improved algorithm for the maximum agreement subtree problem

In this paper, we solve the maximum agreement subtree problem for a set T of k rooted, leaf-labelled evolutionary trees on n leaves where T contains a binary tree. We show that the O(kn/sup 3/)-time dynamic programming algorithm proposed by Farach et al. and Bryant can be implemented in O(n/sup 2/log/sup k-1/n) and O(k/spl middot/n/sup 3-(1/k-1)/) using the k-dimensional binary search tree and the k-dimensional range search tree, respectively.

On some simple widths

The

Trivially-Perfect Width

\mathcal{G}

Block-Graph Width

-width of a class of graphs

Recognition of probe ptolemaic graphs

\mathcal{G}

Classifying rankwidth k -DH-graphs

is defined as follows. A graph G has

Approximation Algorithms for the p-Hub Center Routing Problem in Parameterized Metric Graphs

\mathcal{G}

An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem

-width k if there are k independent sets ℕ1,...,ℕk in G such that G can be embedded into a graph

On the Threshold-Width of Graphs

H \in \mathcal{G}

Block-graph width

such that for every edge e in H which is not an edge in G, there exists an i such that both endpoints of e are in ℕi. For the class