On Improved Time Bounds for Permutation Graph Problems

For many problems on permutation graphs, polynomial time bounds were found by using different approaches as e.g. dynamic programming, structural properties of the intersection model, the reformulation as a shortest-path problem on suitable derived graphs and a geometric representation as points in the plane. Here we outline these approaches and apply them to two problems: minimum weight independent dominating set and maximum weight cycle-free subgraph (minimum weight feedback vertex set).

[1]  Jeremy P. Spinrad,et al.  Bipartite permutation graphs , 1987, Discret. Appl. Math..

[2]  Amir Pnueli,et al.  Permutation Graphs and Transitive Graphs , 1972, JACM.

[3]  K. Arvind,et al.  Connected Domination and Steiner Set on Weighted Permutation Graphs , 1992, Inf. Process. Lett..

[4]  Dieter Kratsch,et al.  On Domination Problems for Permutation and Other Graphs , 1987, Theor. Comput. Sci..

[5]  Dieter Kratsch,et al.  On the restriction of some NP-complete graph problems to permutation graphs , 1985, FCT.

[6]  S. Lakshmivarahan,et al.  A New Approach for the Domination Problem on Permutation Graphs , 1991, Inf. Process. Lett..

[7]  Haklin Kim.  Finding a Maximum Independent Set in a Permutation Graph , 1990, Inf. Process. Lett..

[8]  C. Pandu Rangan,et al.  Efficient Algorithms for the Minimum Weighted Dominating Clique Problem on Permutation Graphs , 1991, Theor. Comput. Sci..

[9]  Lorna Stewart,et al.  Dominating sets in perfect graphs , 1991, Discret. Math..

[10]  Jeremy P. Spinrad,et al.  On Comparability and Permutation Graphs , 1985, SIAM J. Comput..

[11]  A. Lempel,et al.  Transitive Orientation of Graphs and Identification of Permutation Graphs , 1971, Canadian Journal of Mathematics.

[12]  Mikhail J. Atallah,et al.  Finding a minimum independent dominating set in a permutation graph , 1988, Discret. Appl. Math..

[13]  Martin Farber,et al.  Domination in Permutation Graphs , 1985, J. Algorithms.

[14]  Charles J. Colbourn,et al.  Permutation graphs: Connected domination and Steiner trees , 1991, Discret. Math..