Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/11534273_20 ◽

2005 ◽

pp. 218-232 ◽

Cited By ~ 21

Author(s):

Shlomo Moran ◽

Sagi Snir

Download Full-text