A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree; a partial coloring (which assigns colors to some of the ...

May 27, 2005 · A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree; a partial coloring (which assigns colors to ...

Abstract. A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree; a partial coloring (which assigns.

A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree; a partial coloring (which assigns colors to some of the ...

Abstract. A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree; a partial coloring (which assigns.

In this paper we continue the work of [MS05], and present a 2-approximation algorithm of convex recoloring of strings whose running time O(cn), where c is the ...

“Efficient approximation of convex recolorings” is a paper by Shlomo Moran Sagi Snir published in 2007. It has an Open Access status of “closed”. You can read ...

Shlomo Moran, Sagi Snir: Efficient approximation of convex recolorings. J. Comput. Syst. Sci. 73(7): 1078-1089 (2007). manage site settings.

In this paper we continue the work of [MS05], and present a 2-approximation algorithm of convex recoloring of strings whose running time O(cn), where c is the ...