论文信息 - Generate all maximal independent sets in permutation graphs

Generate all maximal independent sets in permutation graphs

In this paper, an O(n log n + k) time algorithm is presented to generate all maximal independent sets in a permutation graph, where n is the number of vertices in the graph and k is the number of vertices generated. The space requirement is O(n log n).

Gen-Huey Chen | Chang Wu Yu

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

[2] Shuji Tsukiyama,et al. A New Algorithm for Generating All the Maximal Independent Sets , 1977, SIAM J. Comput..

[3] Joseph Y.-T. Leung,et al. Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs , 1984, J. Algorithms.

[4] Kenneth J. Supowit,et al. Decomposing a Set of Points into Chains, with Applications to Permutation and Circle Graphs , 1985, Inf. Process. Lett..

[5] Vijay V. Vazirani,et al. NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching , 1985, FSTTCS.

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

[7] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

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

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

[10] Ernst W. Mayr,et al. Perfect Graphs and Parallel Algorithms , 1986, ICPP.

[11] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

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

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