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

Citations (9)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (2)

Marinmoy Hota, Madhumangal Pal & Tapan K. Pal. (1999) An efficient algorithm to generate all maximal independent sets on trapezoid graphs. International Journal of Computer Mathematics 70:4, pages 587-599.
Read now
Madhumangal. Pal. (1998) A parallel algorithm to generate all maximal independent sets on permutation graphs. International Journal of Computer Mathematics 67:3-4, pages 261-274.
Read now

Articles from other publishers (7)

Sreenanda Raut & Madhumangal Pal. (2019) Generation of maximal fuzzy cliques of fuzzy permutation graph and applications. Artificial Intelligence Review 53:3, pages 1585-1614.
Crossref
Madhumangal Pal. 2020. Handbook of Research on Advanced Applications of Graph Theory in Modern Society. Handbook of Research on Advanced Applications of Graph Theory in Modern Society 24 65 .
Carmen Ortiz & Mónica Villanueva. (2017) Maximal independent sets in grid graphs. International Transactions in Operational Research 24:1-2, pages 369-385.
Crossref
Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno & Luca Versari. 2017. String Processing and Information Retrieval. String Processing and Information Retrieval 144 160 .
Carmen Ortiz & Mónica Villanueva. (2012) Maximal independent sets in caterpillar graphs. Discrete Applied Mathematics 160:3, pages 259-266.
Crossref
David Eppstein. (2009) All maximal independent sets and dynamic dominance for sparse graphs. ACM Transactions on Algorithms 5:4, pages 1-14.
Crossref
Stavros D. Nikolopoulos. (2002) Coloring permutation graphs in parallel. Discrete Applied Mathematics 120:1-3, pages 165-195.
Crossref

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.