First asked on math.SE with no replies.
- Suppose I have a planar graph, with a planar embedding, how do I find tree decomposition?
- What is the optimal tree decomposition of a $d$-by-$d$ square grid? Not completely sure how to define "optimal", but it should distinguish between decomposition with one large bag and decomposition with many large bags.