On counting independent sets in sparse graphs

SIAM Journal on Computing

Volumn 31, Issue 5, 2002, Pages 1527-1541

  Dyer, Martin ^a   Frieze, Alan ^a   Jerrum, Mark ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

Primary, 68Q17; Secondary, 05C69, 60J10, 68E10, 68Q25, 68W40

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MARKOV PROCESSES; MONTE CARLO METHODS; POLYNOMIAL APPROXIMATION; SET THEORY;

SPARSE GRAPHS;

GRAPH THEORY;

EID: 0036588882     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701383844     Document Type: Article

References (11)

1. E.A. Bender, The asymptotic number of non-negative integer matrices with given row and column sums, Discrete Math., 10 (1974), pp. 217-223.
2. P. Berman and M. Karpinski, On Some Tighter Inapproximability Results, Further Improvements, Electronic Colloquium on Computational Complexity, Report TR98-065, 1998.
3. G. Brightwell and P. Winkler, Graph homomorphisms and phase transitions, J. Combin. Theory Ser. B, 77 (1999), pp. 221-262.
4. M. Dyer, A. Frieze, and M. Jerrum, On counting independent sets in sparse graphs, in Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS'99), IEEE Computer Society Press, Los Alamitos, CA, 1999, pp. 210-217.
5. M. Dyer and C. Greenhill, On Markov chains for independent sets, J. Algorithms, 35 (2000), pp. 17-49.
6. M. Jerrum, L. Valiant, and V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoret. Comput. Sci., 43 (1986), pp. 169-188.
7. M. Jerrum, Large cliques elude the Metropolis process, Random Structures Algorithms, 3 (1992), pp. 347-359.
8. M. Jerrum and A. Sinclair, The Markov chain Monte Carlo method: An approach to approximate counting and integration, in Approximation Algorithms for NP-Hard Problems, D. Hochbaum, ed., PWS Publishing, Boston, 1996, pp. 482-520.
9. M. Luby and E. Vigoda, Approximately counting up to four, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, ACM Press, New York, 1997, pp. 682-687.
10. J. Håstad, Some optimal inapproximability results, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, ACM Press, New York, 1997, pp. 1-10.
11. C.H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.