ON DOMINATION PROBLEMS FOR PERMUTATION AND OTHER GRAPHS

There is an increasing interest in results on the influence of restricting NP-complete graph problems, to special classes of perfect graphs as, e. g. , permutation graphs. In this paper we give (i) an algorithm with time bound O(n**2) for the weighted independent domination problem on permutation graphs (which is an improvement of the O(n**3) solution; (ii) a polynomial time solution for the weighted feedback vertex set problem on permutation graphs; (iii) an investigation of weighted dominating clique problems for several graph classes including an NP-completeness result for weakly triangulated graphs as well as polynomial time bounds.