On counting independent sets in sparse graphs

被引：79

作者：

Dyer, M ^{[1
]}

Frieze, A

Jerrum, M

机构：

[1] Univ Leeds, Sch Comp Sci, Leeds LS2 9JT, W Yorkshire, England

[2] Carnegie Mellon Univ, Dept Math, Pittsburgh, PA 15213 USA

[3] Univ Edinburgh, Dept Comp Sci, Edinburgh EH9 3JZ, Midlothian, Scotland

来源：

SIAM JOURNAL ON COMPUTING | 2002年 / 31卷 / 05期

关键词：

primary; 68Q17; Secondary; 05C69; 60J10; 68E10; 68Q25; 68W40;

D O I：

10.1137/S0097539701383844

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We prove two results concerning approximate counting of independent sets in graphs with constant maximum degree Delta. The first implies that the Markov chain Monte Carlo technique is likely to fail if Delta greater than or equal to 6. The second shows that no fully polynomial randomized approximation scheme can exist for Delta greater than or equal to 25, unless RP = NP.

引用

页码：1527 / 1541

页数：15

共 50 条

[1] The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
C. Greenhill
[J]. computational complexity, 2000, 9 : 52 - 72
[2] The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
Greenhill, C
[J]. COMPUTATIONAL COMPLEXITY, 2000, 9 (01) : 52 - 72
[3] Counting independent sets in graphs
Samotij, Wojciech
[J]. EUROPEAN JOURNAL OF COMBINATORICS, 2015, 48 : 5 - 18
[4] Counting independent sets in cocomparability graphs
Dyer, Martin
Mueller, Haiko
[J]. INFORMATION PROCESSING LETTERS, 2019, 144 : 31 - 36
[5] Counting independent sets in tricyclic graphs
Poureidi, Abolfazl
[J]. DISCRETE APPLIED MATHEMATICS, 2023, 331 : 138 - 146
[6] 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)
[7] INDEPENDENT SETS IN RANDOM SPARSE GRAPHS
GAZMURI, PG
[J]. NETWORKS, 1984, 14 (03) : 367 - 377
[8] 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
[9] Counting independent sets in graphs of hyperplane arrangements
Guo, Nicholas
Yue, Guangyi
[J]. DISCRETE MATHEMATICS, 2020, 343 (03)
[10] 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

← 1 2 3 4 5 →