Counting independent sets in cocomparability graphs

被引：3
|
作者：
Dyer, Martin [1 ]
Mueller, Haiko [1 ]
机构：
[1] Univ Leeds, Sch Comp, Leeds LS2 9JT, W Yorkshire, England
来源：
INFORMATION PROCESSING LETTERS | 2019年 / 144卷
基金：
英国工程与自然科学研究理事会;
关键词：
Graph algorithms; Cocomparability graph; Independent set; Counting; Linear time algorithm; COMPLEXITY;
D O I：
10.1016/j.ipl.2018.12.005
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We show that the number of independent sets in cocomparability graphs can be counted in linear time, as can counting cliques in comparability graphs. By contrast, counting cliques in cocomparability graphs and counting independent sets in comparability graphs are #P-complete. We extend these results to counting maximal cliques and independent sets. We also consider the fixed-parameter versions of counting cliques and independent sets of given size k. Finally, we combine the results to show that both counting cliques and independent sets in permutation graphs are in linear time. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码：31 / 36
页数：6
相关论文
共 50 条
  • [1] Counting independent sets in graphs
    Samotij, Wojciech
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2015, 48 : 5 - 18
  • [2] Counting independent sets in tricyclic graphs
    Poureidi, Abolfazl
    [J]. DISCRETE APPLIED MATHEMATICS, 2023, 331 : 138 - 146
  • [3] On counting independent sets in sparse graphs
    Dyer, M
    Frieze, A
    Jerrum, M
    [J]. SIAM JOURNAL ON COMPUTING, 2002, 31 (05) : 1527 - 1541
  • [4] Counting independent sets in Riordan graphs
    Cheon, Gi-Sang
    Jung, Ji-Hwan
    Kang, Bumtle
    Kim, Hana
    Kim, Suh-Ryung
    Kitaev, Sergey
    Mojallal, Seyed Ahmad
    [J]. DISCRETE MATHEMATICS, 2020, 343 (11)
  • [5] Counting the number of independent sets in chordal graphs
    Okamoto, Yoshio
    Uno, Takeaki
    Uehara, Ryuhei
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2008, 6 (02) : 229 - 242
  • [6] Counting independent sets in graphs of hyperplane arrangements
    Guo, Nicholas
    Yue, Guangyi
    [J]. DISCRETE MATHEMATICS, 2020, 343 (03)
  • [7] Counting independent sets in unbalanced bipartite graphs
    Cannon, Sarah
    Perkins, Will
    [J]. PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 1456 - 1466
  • [8] Counting Maximal Independent Sets in Subcubic Graphs
    Junosza-Szaniawski, Konstanty
    Tuczynski, Michal
    [J]. SOFSEM 2012: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2012, 7147 : 325 - 336
  • [9] Counting independent sets in unbalanced bipartite graphs
    Cannon, Sarah
    Perkins, Will
    [J]. PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1456 - 1466
  • [10] Counting independent sets and maximal independent sets in some subclasses of bipartite graphs
    Lin, Min-Sheng
    [J]. DISCRETE APPLIED MATHEMATICS, 2018, 251 : 236 - 244
12345