The complexity of counting colourings and independent sets in sparse graphs and hypergraphs

被引：58
|
作者：
Greenhill, C [1 ]
机构：
[1] Univ Leeds, Sch Comp Studies, Leeds LS2 9JT, W Yorkshire, England
来源：
COMPUTATIONAL COMPLEXITY | 2000年 / 9卷 / 01期
关键词：
graph colourings; independent sets; #P-completeness; interpolation;
D O I：
10.1007/PL00001601
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider certain counting problems involving colourings of graphs and independent sets in hypergraphs. Using polynomial interpolation techniques, we show that these problems are #P-complete. Therefore, efficient approximate counting is the most one can realistically expect to achieve. Rapidly mixing Markov chains which can be used for approximately solving some of these counting problems have been recently developed by the author and others.
引用
收藏
页码：52 / 72
页数：21
相关论文
共 50 条
  • [1] The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
    C. Greenhill
    computational complexity, 2000, 9 : 52 - 72
  • [2] On counting independent sets in sparse graphs
    Dyer, M
    Frieze, A
    Jerrum, M
    SIAM JOURNAL ON COMPUTING, 2002, 31 (05) : 1527 - 1541
  • [3] Counting Independent Sets in Hypergraphs
    Cooper, Jeff
    Dutta, Kunal
    Mubayi, Dhruv
    COMBINATORICS PROBABILITY & COMPUTING, 2014, 23 (04): : 539 - 550
  • [4] Counting independent sets in regular hypergraphs
    Balogh, Jozsef
    Bollobas, Bela
    Narayanan, Bhargav
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2021, 180
  • [5] Inapproximability of counting independent sets in linear hypergraphs
    Qiu, Guoliang
    Wang, Jiaheng
    INFORMATION PROCESSING LETTERS, 2024, 184
  • [6] Counting independent sets in graphs
    Samotij, Wojciech
    EUROPEAN JOURNAL OF COMBINATORICS, 2015, 48 : 5 - 18
  • [7] Streaming Algorithms for Independent Sets in Sparse Hypergraphs
    Halldorsson, Bjarni V.
    Halldorsson, Magnus M.
    Losievskaja, Elena
    Szegedy, Mario
    ALGORITHMICA, 2016, 76 (02) : 490 - 501
  • [8] Streaming Algorithms for Independent Sets in Sparse Hypergraphs
    Bjarni V. Halldórsson
    Magnús M. Halldórsson
    Elena Losievskaja
    Mario Szegedy
    Algorithmica, 2016, 76 : 490 - 501
  • [9] DISJOINT MAXIMAL INDEPENDENT SETS IN GRAPHS AND HYPERGRAPHS
    Dorbec, Paul
    Kaci, Fatma
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2024, 44 (04) : 1361 - 1371
  • [10] Finding large independent sets in graphs and hypergraphs
    Shachnai, H
    Srinivasan, A
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 18 (03) : 488 - 500
12345