181 search results - page 1 / 37 » Improved Approximation Algorithm for Convex Recoloring of Tr... |
WAOA
2005
Springer
13 years 10 months ago
2005
Springer
COCOON
2009
Springer
13 years 11 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
JCSS
2008
13 years 4 months ago
2008
ACID
2006
13 years 6 months ago
2006
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
JMLR
2010
12 years 11 months ago
2010
The FastInf C++ library is designed to perform memory and time efficient approximate inference in large-scale discrete undirected graphical models. The focus of the library is pro...