论文信息 - Finding a Maximum Independent Set in a Permutation Graph - 字舞流文

Finding a Maximum Independent Set in a Permutation Graph

Abstract This paper presents an O( n log n ) algorithm for finding a maximum independent set in a permutation graph.

[1] Charles J. Colbourn,et al. On testing isomorphism of permutation graphs , 1981, Networks.

[2] L. Lovász. A Characterization of Perfect Graphs , 1972 .

[3] J. Keil,et al. Finding minimum dominating cycles in permutation graphs , 1985 .

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

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

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

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

[8] G. Sposito,et al. Graph theory and theoretical physics , 1969 .

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