A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions.

Kustaa Kangas Mikko Koivisto Sami Salonen

Published in: IPEC (2018)

Keyphrases

tree decomposition
search space
cost function
dynamic programming
computational complexity
worst case
machine learning
image sequences
objective function
optimal solution
search algorithm
np hard
complex networks
decomposition method