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

Computational Complexity

Volumn 9, Issue 1, 2000, Pages 52-72

  Greenhill, Catherine ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

P completeness; Graph colourings; Independent sets; Interpolation

Indexed keywords

EID: 0034356673     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00001601     Document Type: Article

References (12)

1. R. BUBLEY AND M. DYER (1996). Graph orientations with no sink and an approximation for a hard case of #SAT. In Proc. Eighth Ann. ACM-SIAM Symp. Discr. Alg., ACM-SIAM, New York-Philadelphia, 248-257.
2. R. BUBLEY, M. DYER, C. GREENHILL, AND M. JERRUM (1999). On approximately counting colourings of small degree graphs. SIAM J. Comput. (to appear).
3. M. DYER AND C. GREENHILL (1997). On Markov chains for independent sets. Preprint.
4. K. EDWARDS (1986). The complexity of colouring problems on dense graphs. Theoret. Comput. Sci. 43, 337-343.
5. F. JAEGER, D. L. VERTIGAN, AND D. WELSH (1990). On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Cambridge Philos. Soc. 108, 35-53.
6. J. H. VAN LINT AND R. M. WILSON (1992). A Course in Combinatorics. Cambridge Univ. Press, Cambridge.
7. M. LUBY AND E. VIGODA (1997). Approximately counting up to four. In Proc. Twenty-ninth Ann. ACM Symp. Theor. Comput., ACM, New York, 682-687.
8. C. H. PAPADIMITRIOU (1994). Computational Complexity. Addison-Wesley, Reading, MA.
9. D. ROTH (1996). On the hardness of approximate reasoning. Artificial Intelligence 82, 273-302.
10. S. VADHAN (1995). The complexity of counting. Undergraduate thesis, Harvard Univ.
11. S. P. VADHAN (1997). The complexity of counting in sparse, regular, and planar graphs. Preprint (available from http://www-math.mit.edu/~salil/).
12. L. G. VALIANT (1979). The complexity of enumeration and reliability problems. SIAM J. Comput. 8, 410-421.