GD
2001
Springer
13 years 9 months ago
2001
Springer
We prove that every tree T = (V, E) on n vertices with edges of unit length can be embedded in the plane with distortion O( √ n); that is, we construct a mapping f: V → R2 suc...
SPIRE
2009
Springer
13 years 11 months ago
2009
Springer
Given a pattern p over an alphabet Σp and a text t over an alphabet Σt, we consider the problem of determining a mapping f from Σp to Σ+ t such that t = f(p1)f(p2) . . . f(pm)....