What people are saying - Write a review
We haven't found any reviews in the usual places.
A')-coloring problem adjacent algorithm assume bipartite graph bounded clauses coloring of G coloring problem combinatorial complete bipartite graph complete graph component condition configuration conjecture consider constraint graph contains contours Corollary corresponding counting the number defined degree denote digraph directed graph dismantlable edge Editors exists finite formula function G to H Gibbs measures given Glauber dynamics graph G Graph homomorphisms H-coloring hamiltonian hence Hom(G HORN-SAT implies independent set induced path input graph irreflexive Ising model label Lemma list coloring list homomorphisms long range action loop Markov chains Math Mathematics mean-field approximation Nesetfil node non-periodic closed walks NP-complete obtained optimization parameterized partial weighted assignment partition phase transition Phys polymer polynomial Potts models probability proof of Theorem prove random walk reconstruction problem satisfies spin glass stationary distribution statistical physics subset Theorem 2.1 tree decomposition treewidth variables vertex of Ax vertices well-linked with respect Winkler
Page 85 - P. Hell, J. Nesetfil, and X. Zhu, Duality and polynomial testing of tree homomorphisms, Trans. Amer. Math. Soc.
Volume 63 "Graphs, Morphisms and Statistical Physics"
New Books for 05/14/2004
The restrictive <i>H</i>-coloring problem
Discrete Mathematics : List homomorphisms of graphs with bounded ...
Graphs, morphisms, and statistical physics: - / 2004 - Livros
List of Publications
Correlation decay and deterministic FPTAS for counting list ...
LNCS 3221 - Fixed Parameter Algorithms for Counting and Deciding ...