Clique transversal and clique independence on comparability graphs

Date Issued
27-05-1996
Author(s)
Balachandran, V.
Nagavamsi, P.
Indian Institute of Technology, Madras
DOI
Abstract
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.
Volume
58
Subjects