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

Kustaa Kangas Mikko Koivisto Sami Salonen

Published in: Algorithmica (2020)

Keyphrases

tree decomposition
dynamic programming
computational complexity
search space
np hard
worst case
simulated annealing
decomposition method
objective function
optimal solution
probabilistic model
programming language