An algorithm for the Tutte polynomials of graphs of bounded treewidth.

Artur Andrzejak

Published in: Discret. Math. (1998)

Keyphrases

computational complexity
dynamic programming
learning algorithm
information retrieval
optimal solution
graph structure
bounded treewidth
objective function
sufficient conditions
undirected graph