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.
Author supplied keywords
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? Sign in
Sign up for free