The complexity of counting graph homomorphisms
暂无分享,去创建一个
[1] Salil P. Vadhan,et al. The Complexity of Counting in Sparse, Regular, and Planar Graphs , 2002, SIAM J. Comput..
[2] J. Lebowitz,et al. Phase Transitions in Binary Lattice Gases , 1971 .
[3] Harry B. Hunt,et al. The Complexity of Planar Counting Problems , 1998, SIAM J. Comput..
[4] Catherine S. Greenhill. The complexity of counting colourings and independent sets in sparse graphs and hypergraphs , 2000, computational complexity.
[5] Michael O. Albertson,et al. Homomorphisms of 3-chromatic graphs , 1985, Discret. Math..
[6] Leslie G. Valiant,et al. The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..
[7] Martin E. Dyer,et al. On Approximately Counting Colorings of Small Degree Graphs , 1999, SIAM J. Comput..
[8] Jaroslav Nesetril,et al. Universal H-colorable graphs without a given configuration , 2002, Discrete Mathematics.
[9] Stefan A. Burr,et al. On unavoidable digraphs in orientations of graphs , 1987, J. Graph Theory.
[10] Robert W. Irving,et al. NP-completeness of a family of graph-colouring problems , 1983, Discret. Appl. Math..
[11] John S. Rowlinson,et al. New Model for the Study of Liquid–Vapor Phase Transitions , 1970 .
[12] J. Steif,et al. Non-uniqueness of measures of maximal entropy for subshifts of finite type , 1994, Ergodic Theory and Dynamical Systems.
[13] D. Welsh,et al. On the computational complexity of the Jones and Tutte polynomials , 1990, Mathematical Proceedings of the Cambridge Philosophical Society.
[14] Peter Winkler,et al. Graph Homomorphisms and Phase Transitions Bell Laboratories 2c-379 Lucent Technologies 700 Mountain Ave , 1997 .
[15] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[16] Martin E. Dyer,et al. On Markov Chains for Independent Sets , 2000, J. Algorithms.
[17] Jaroslav Nesetril,et al. On the complexity of H-coloring , 1990, J. Comb. Theory, Ser. B.
[18] Jeff Kahn,et al. An Entropy Approach to the Hard-Core Model on Bipartite Graphs , 2001, Combinatorics, Probability and Computing.
[19] D. Welsh. Complexity: Knots, Colourings and Counting: Link polynomials and the Tait conjectures , 1993 .
[20] N. Linial. Hard enumeration problems in geometry and combinatorics , 1986 .