We show how to maintain a data structure on trees which allows for the following operations, all in worst-case constant time: 1. insertion of leaves and internal nodes, 2. deletion of leaves, 3.â€¦ (More)

(MATH) This paper obtains the following results on pattern matching problems in which the text has length <i>n</i> and the pattern has length <i>m</i><ul><li>An <i>O</i>(<i>n</i>log <i>m</i>) timeâ€¦ (More)

We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The first algorithm, whichâ€¦ (More)

The Maximum Agreement Subtree problem is the following: given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these items so that theâ€¦ (More)

Remarkable breakthroughs have been made recently in obtaining approximate solutions to some fundamental NP Complete problems namely Max Cut Max k Cut Max Sat Max Dicut Max Bisection k Vertex Coloringâ€¦ (More)

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V,E). The expected running time of our algorithm is Ã•(mc) where |E| = m and c is theâ€¦ (More)

lle main goal of this paper is to give an efficient algorithm for the Tree Pattern Matching problem. We also introduce and give an efficient algorithm for the Subset Matching problem. The Subsetâ€¦ (More)

We present a general framework for constructing cut sparsifiers in undirected graphs --- weighted subgraphs for which every cut has the same weight as the original graph, up to a multiplicativeâ€¦ (More)