Clique transversal and clique independence on comparability graphs

32Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Balachandran, V., Nagavamsi, P., & Rangan, C. P. (1996). Clique transversal and clique independence on comparability graphs. Information Processing Letters, 58(4), 181–184. https://doi.org/10.1016/0020-0190(96)00054-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free