Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 79, 2002 - Issue 10
Submit an article Journal homepage
39
Views
9
CrossRef citations to date
0
Altmetric
Original Articles

An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs

Debashis Bera Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, 721 102, India
,
Madhumangal Pal Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, 721 102, India
&
Tapan Pal Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, 721 102, India
Pages 1057-1065 | Published online: 15 Sep 2010

  • Booth , K. S. and Lueker , G. S. 1976 . Testing for consecutive ones property, interval graphs and planarity using PQtree algorithms . J. Computer System Science , 13 : 335 – 379 .
  • Cheah , F. and Corneil , D. G. 1996 . On the structure of trapezoid graphs . Discrete Applied Mathematics , 66 : 109 – 133 .
  • Dagan , I. , Golumbic , M. C. and Pinter , R. Y. 1988 . Trapezoid graphs and their coloring . Discrete Applied Mathematics , 21 : 35 – 46 .
  • Dahlhaus , E. and Karpinski , M. A. Fast parallel algorithm for computing all maximal cliques in a graph and the related problems . 1st Scandinavian Workshop on Algorithm Theory . Vol. 318 , pp. 139 – 144 . LNCS . SWAT 88
  • Golumbic , M. C. 1980 . Algorithmic graph theory and perfect graphs , Academic Press .
  • Ho , C. W. and Lee , R. C. T. 1988 . Efficient parallel algorithms for finding maximal cliques, cliques trees and minimum coloring on cordal graphs . Information Processing Letters , 28 : 301 – 309 .
  • Hota , M. , Pal , M. and Pal , T. K. 1999 . An efficient algorithm to generate all maximal independent sets on trapezoid graphs . Intern J. Computer Math , 70 : 587 – 599 .
  • Kirsch , E. S. and Bair , J. R. Practical parallel algorithm for chordal graphs . In Proc. 29th Annual IEEE Symposium of Foundations of Computer Science . pp. 150 – 161 .
  • Ma , T. H. and Spinrad , J. P. 1994 . On the 2-chain subgraph cover and related problems . J. Algorithms , 17 : 251 – 268 .
  • Naor , J. , Naor , M. and Schaffer , A. A. 1989 . Fast parallel algorithms for chordal grpahs . SIAM J. Computing , 18 : 327 – 349 .
  • Pal , M. and Bhattacharjee , G. P. 1995 . An optimal parallel algorithm for computing all maximal cliques of an interval graph and its applications . J. institution of Engineers (India} , 76 : 22 – 33 .

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.