Finding a tree decomposition of a graph in Python

Question

I need an algorithm that can find a tree decomposition given a graph in Python, the graphs will be small so it doesn't need to be very efficient. I have looked around but cannot find much on this at all. Anyone know of a package that can do this or some sudo code I could use to make my own?

sounds related to [CSTheory: Program for computing Tree decomposition of a graph](https://cstheory.stackexchange.com/questions/6034/program-for-computing-tree-decomposition-of-a-graph) — chickity china chinese chicken, Nov 01 '18 at 17:51

score 1 · Answer 1 · answered Oct 31 '18 at 17:55

1

Have you looked at networkx? See: https://networkx.github.io/documentation/latest/reference/algorithms/approximation.html

answered Oct 31 '18 at 17:55

Josep Valls

5,483
2
33
67

Finding a tree decomposition of a graph in Python

1 Answers1