Convex recolorings of strings and trees: Definitions, hardness results and algorithms

Shlomo Moran, Sagi Snir. Convex recolorings of strings and trees: Definitions, hardness results and algorithms. J. Comput. Syst. Sci., 74(5):850-869, 2008. [doi]

@article{MoranS08:0,
  title = {Convex recolorings of strings and trees: Definitions, hardness results and algorithms},
  author = {Shlomo Moran and Sagi Snir},
  year = {2008},
  doi = {10.1016/j.jcss.2007.10.003},
  url = {http://dx.doi.org/10.1016/j.jcss.2007.10.003},
  researchr = {https://researchr.org/publication/MoranS08%3A0},
  cites = {0},
  citedby = {0},
  journal = {J. Comput. Syst. Sci.},
  volume = {74},
  number = {5},
  pages = {850-869},
}