On the Enumeration of all Minimal Triangulations [article]

Nofar Carmeli, Batya Kenig, Benny Kimelfeld
2016 arXiv   pre-print
We present an algorithm that enumerates all the minimal triangulations of a graph in incremental polynomial time. Consequently, we get an algorithm for enumerating all the proper tree decompositions, in incremental polynomial time, where "proper" means that the tree decomposition cannot be improved by removing or splitting a bag.
arXiv:1604.02833v1 fatcat:g32g6p4np5cenf6k56hr3ezb2i