Clique transversal and clique independence on comparability graphs

被引：41
|
作者：
Balachandran, V
Nagavamsi, P
Rangan, CP
机构：
[1] Indian Institute of Technology
[2] Theor. Computer Science Laboratory, Dept. of Comp. Sci. and Engineering, Indian Institute of Technology
来源：
INFORMATION PROCESSING LETTERS | 1996年 / 58卷 / 04期
关键词：
algorithms; clique transversal; clique independence;
D O I：
10.1016/0020-0190(96)00054-3
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We present O(m root 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 x n matrices.
引用
下载
收藏
页码：181 / 184
页数：4
相关论文
共 50 条
  • [1] Clique-transversal sets and clique-coloring in planar graphs
    Shan, Erfang
    Liang, Zuosong
    Kang, Liying
    EUROPEAN JOURNAL OF COMBINATORICS, 2014, 36 : 367 - 376
  • [2] Approximability of Clique Transversal in Perfect Graphs
    Samuel Fiorini
    R. Krithika
    N. S. Narayanaswamy
    Venkatesh Raman
    Algorithmica, 2018, 80 : 2221 - 2239
  • [3] Approximability of Clique Transversal in Perfect Graphs
    Fiorini, Samuel
    Krithika, R.
    Narayanaswamy, N. S.
    Raman, Venkatesh
    ALGORITHMICA, 2018, 80 (08) : 2221 - 2239
  • [4] Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs
    Lee, Chuan-Min
    ALGORITHMS, 2021, 14 (01)
  • [5] ON CLIQUE COVERS AND INDEPENDENCE NUMBERS OF GRAPHS
    BRIGHAM, RC
    DUTTON, RD
    DISCRETE MATHEMATICS, 1983, 44 (02) : 139 - 144
  • [6] Signed clique-transversal functions in graphs
    Wang, Haichao
    Kang, Liying
    Shan, Erfang
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2010, 87 (11) : 2398 - 2407
  • [7] Clique-transversal number in cubic graphs
    Shan, Erfang
    Liang, Zuosong
    Cheng, T. C. E.
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2008, 10 (02): : 115 - 123
  • [8] Clique-transversal number in cubic graphs
    Shan, Erfang
    Zuosong, Liang
    Cheng, T.C.E.
    Discrete Mathematics and Theoretical Computer Science, 2008, 10 (02): : 115 - 124
  • [9] Clique-transversal sets in cubic graphs
    Liang, Zuosong
    Shan, Erfang
    Cheng, T. C. E.
    COMBINATORICS, ALGORITHMS, PROBABILISTIC AND EXPERIMENTAL METHODOLOGIES, 2007, 4614 : 107 - +
  • [10] On the clique-transversal number of chordal graphs
    Andreae, T
    DISCRETE MATHEMATICS, 1998, 191 (1-3) : 3 - 11
12345