Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 47, 1993 - Issue 1-2
Submit an article Journal homepage
23
Views
9
CrossRef citations to date
0
Altmetric
Original Articles

Generate all maximal independent sets in permutation graphs

Chang-Wu Yu Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan
&
Gen-Huey Chen Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan
Pages 1-8 | Published online: 19 Mar 2007

References

  • Atallah , M. J. , Manacher , G. K. and Urrutia , J. 1988 . Finding a minimum independent dominating set in a permutation graph . Discrete Applied Mathematics , 21 : 177 – 183 .
  • Brandstadt , A. and Kratsch , D. 1987 . On domination problems for permutation and other graphs . Theoretical Computer Science , 54 : 181 – 198 .
  • Farber , M. and Keil , J. M. 1985 . Domination in permutation graphs . Journal of Algorithms , 6 : 309 – 321 .
  • Golumbic , M. C. 1980 . Algorithmic Graph Theory and Perfect Graphs , N.Y : Academic Press .
  • Helmbold , D. and Mayr , E. 1986 . Proceedings of the International Conference on Parallel Processing . Perfect graphs and parallel algorithms . 1986 . pp. 853 – 860 .
  • Knuth , D. E. 1968 . The Art of Computer Programming , Vol. 1 , Reading, MA : Addison-Wesley .
  • Kozen , D. , Vazirani , U. V. and Vazirani , V. V. 1985 . Proceedings of the Fifth Conference on Foundation of Software Technology and Theoretical Computer Science . NC algorithms for comparability graphs, interval graphs, and testing for unique perfect matching . 1985 , New Delhi. pp. 498 – 503 .
  • Leung , J. Y.-T. 1984 . Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs . Journal of Algorithms , 5 22 – 35 .
  • Liu , C. L. 1968 . Introduction to Combinatorial Mathematics , McGraw-Hill .
  • Pnueli , A. , Lempel , A. and Even , S. 1971 . Transitive orientation of graphs and identification of permutation graphs . Can. J. Math. , 23 : 160 – 175 .
  • Spinrad , J. 1985 . On comparability and permutation graphs' . SIAM Journals on Computing , 14 : 658 – 670 .
  • Spinrad , J. , Brandstadt , A. and Stewart , L. 1987 . Bipartite permutation graphs . Discrete Applied Mathematics , 18 : 279 – 292 .
  • Supowit , K. J. 1985 . Decomposing a set of points into chains, with applications to permutation and circle graphs . Information Processing Letters , 21 : 249 – 252 .
  • Tsai , K. H. and Hsu , W. L. 1990 . Fast algorithms for the dominating set problem on permutation graphs . Lecture Notes in Computer Science: Algorithms , 450 : 109 – 117 .
  • Tsukiyama , S. , Ide , M. , Ariyoshi , H. and Shirakawa , I. 1977 . A new algorithm for generating all the maximal independent sets . SIAM Journals Computing , 6 : 505 – 517 .
  • Yu C. W. On some domination problems about the planar points National Tsing Hua University Taiwan 1989 572 Master thesis

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.