Clique transversal and clique independence on comparability graphs

  • Balachandran V
  • Nagavamsi P
  • Rangan C
  • 5


    Mendeley users who have this article in their library.
  • 32


    Citations of this article.


We present O(m√n + M(n)) algorithms for finding the clique transversal number and the clique independence number for a comparability graph of n nodes, where M(n) is the complexity of multiplying two n × n matrices.

Author-supplied keywords

  • Algorithms
  • Clique independence
  • Clique transversal

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • V. Balachandran

  • P. Nagavamsi

  • C. Pandu Rangan

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free