Hardness of computing width parameters based on branch decompositions over the vertex set.

Sigve Hortemo Sæther Martin Vatshelle

Published in: Theor. Comput. Sci. (2016)

Keyphrases

vertex set
computational complexity
parameter values
neural network
bayesian networks
expectation maximization
parameter space
image processing
optimal solution
maximum likelihood
gray scale
weighted graph