Approximating algorithms for the shortest common superstring problem. Information and Computation (1989)

by J S Turner
Venue:in V such that e = (u; v) and f = (w; v) or e = (v; u) and f = (v; w). In other words, e and