I have a family of graphs whose path decompositions I know. Is it possible to compute the tree-width of these graphs in polynomial time?
Asked
Active
Viewed 24 times
