58
Views
9
CrossRef citations to date
0
Altmetric
Original Articles

An efficient algorithm to generate all maximal independent sets on trapezoid graphs

, &
Pages 587-599 | Received 10 Mar 1998, Published online: 19 Mar 2007

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

Read on this site (1)

Debashis Bera, Madhumangal Pal & Tapan Pal. (2002) An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs. International Journal of Computer Mathematics 79:10, pages 1057-1065.
Read now

Articles from other publishers (8)

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 .
Sk. Amanathulla & Madhumangal Pal. (2018) Surjective L (2, 1)-labeling of cycles and circular-arc graphs. Journal of Intelligent & Fuzzy Systems 35:1, pages 739-748.
Crossref
Madhumangal Pal & Anita Pal. (2016) Scheduling Algorithm to Select Optimal Programme Slots in Television Channels: A Graph Theoretic Approach. International Journal of Applied and Computational Mathematics 3:3, pages 1931-1950.
Crossref
Carmen Ortiz & Mónica Villanueva. (2017) Maximal independent sets in grid graphs. International Transactions in Operational Research 24:1-2, pages 369-385.
Crossref
Carmen Ortiz & Mónica Villanueva. (2012) Maximal independent sets in caterpillar graphs. Discrete Applied Mathematics 160:3, pages 259-266.
Crossref
Anita Saha, Madhumangal Pal & Tapan K. Pal. (2007) Selection of programme slots of television channels for giving advertisement: A graph theoretic approach. Information Sciences 177:12, pages 2480-2492.
Crossref
Anita Saha, Madhumangal Pal & Tapan K. Pal. (2005) An efficient pram algorithm for maximum-weight independent set on permutation graphs. Journal of Applied Mathematics and Computing 19:1-2, pages 77-92.
Crossref
Debashis Bera, Madhumangal Pal & Tapan K. Pal. (2003) An optimal pram algorithm for a spanning tree on trapezoid graphs. Journal of Applied Mathematics and Computing 12:1-2, pages 21-29.
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:

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:

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.