Sciweavers

Share
27 search results - page 1 / 6
» Convex Recoloring Revisited: Complexity and Exact Algorithms
Sort
View
COCOON
2009
Springer
10 years 7 months ago
Convex Recoloring Revisited: Complexity and Exact Algorithms
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...
Iyad A. Kanj, Dieter Kratsch
ACID
2006
236views Algorithms» more  ACID 2006»
10 years 2 months ago
Kernelization for Convex Recoloring
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...
Hans L. Bodlaender, Michael R. Fellows, Michael A....
JMLR
2010
118views more  JMLR 2010»
9 years 8 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano
VVS
1998
IEEE
106views Visualization» more  VVS 1998»
10 years 5 months ago
An Exact Interactive Time Visibility Ordering Algorithm for Polyhedral Cell Complexes
A visibility ordering of a set of objects, from a given viewpoint, is a total order on the objects such that if object a obstructs object b, then b precedes a in the ordering. Suc...
Cláudio T. Silva, Joseph S. B. Mitchell, Pe...
RSFDGRC
2005
Springer
208views Data Mining» more  RSFDGRC 2005»
10 years 6 months ago
On the Complexity of Probabilistic Inference in Singly Connected Bayesian Networks
Abstract. In this paper, we revisit the consensus of computational complexity on exact inference in Bayesian networks. We point out that even in singly connected Bayesian networks,...
Dan Wu, Cory J. Butz
books