54 citations · 64 across the 8 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2010★ 54 cited
Finding and counting vertex-colored subtrees
Sylvain Guillemot, Florian Sikora
The problems studied in this article originate from the Graph Motif problem introduced by Lacroix et al. in the context of biological networks. The problem is to decide if a vertex…
cs.CC2008★ 3 cited
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems
Sylvain Guillemot, Francois Nicolas, Vincent Berry +1
This paper has been withdrawn by the corresponding author because the newest version is now published in Discrete Applied Mathematics.
cs.CC2008★ 2 cited
Solving the Maximum Agreement SubTree and the Maximum Compatible Tree problems on many bounded degree trees
Sylvain Guillemot, Francois Nicolas
Given a set of leaf-labeled trees with identical leaf sets, the well-known "Maximum Agreement SubTree" problem (MAST) consists of finding a subtree homeomorphically included in all…