26 search results - page 6 / 6 » Minimum Common String Partition Problem: Hardness and Approx... |
SIAMDM
2008
13 years 4 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...