Algorithms for weakly triangulated graphs Original Research Article

We present improved algorithms for the recognition and the weighted versions of the optimization problems for the class of weakly triangulated graphs. In particular, we improve the complexity of the recognition problem from O(n4.376) to O(mn2), the complexity of finding maximum weighted clique and minimum weighted coloring from O(n5) to O(n4), and the complexity of finding maximum weighted independent set and minimum weighted clique cover from O(mn3) to O(n4).