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 条
  • [41] CLIQUE GRAPHS AND HELLY GRAPHS
    BANDELT, HJ
    PRISNER, E
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1991, 51 (01) : 34 - 45
  • [42] Clique graphs of planar graphs
    Alcón, L
    Gutierrez, M
    ARS COMBINATORIA, 2004, 71 : 257 - 265
  • [43] ON CLIQUE CONVERGENT GRAPHS
    BORNSTEIN, CF
    SZWARCFITER, JL
    GRAPHS AND COMBINATORICS, 1995, 11 (03) : 213 - 220
  • [44] Chordal graphs and their clique graphs
    Galinier, P
    Habib, M
    Paul, C
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1995, 1017 : 358 - 371
  • [45] CLIQUE GRAPHS OF PACKED GRAPHS
    SATO, I
    DISCRETE MATHEMATICS, 1986, 62 (01) : 107 - 109
  • [46] A CHARACTERIZATION OF CLIQUE GRAPHS
    ROBERTS, FS
    SPENCER, JH
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1969, 16 (03): : 508 - &
  • [47] CLIQUE COVERING OF GRAPHS
    PYBER, L
    COMBINATORICA, 1986, 6 (04) : 393 - 398
  • [48] Delsarte clique graphs
    Bang, S.
    Hiraki, A.
    Koolen, J. H.
    EUROPEAN JOURNAL OF COMBINATORICS, 2007, 28 (02) : 501 - 516
  • [49] CLIQUE NUMBERS OF GRAPHS
    ERDOS, P
    ERNE, M
    DISCRETE MATHEMATICS, 1986, 59 (03) : 235 - 242
  • [50] Clique domination in graphs
    Xu, Guangjun
    Shan, Erfang
    Zhao, Min
    ARS COMBINATORIA, 2010, 97A : 169 - 180
12345