1. Write a Python program that finds an optimal path decomposition of graphs.
2. Improve a given path decomposition by local changes?
3. Use minimal vertex separators in order to find path decompositions of small width?
"Quality is Not an Act it is a Habit"
I believe that my experience and skill in this background will prove to be of great help to you. Contact me to discuss more on the details