216 search results - page 1 / 44 » Computing the partition function for graph homomorphisms wit... |
COMBINATORICS
2006
13 years 4 months ago
2006
With a graph G = (V, E) we associate a collection of non-negative real weights vV {i,v : 1 i m} uvE{ij,uv : 1 i j m}. We consider the probability distribution on {f : V {1,...
GC
2010
Springer
13 years 3 months ago
2010
Springer
A directed graph has a natural Z-module homomorphism from the underlying graph’s cycle space to Z where the image of an oriented cycle is the number of forward edges minus the n...
STOC
2006
ACM
14 years 4 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
ICALP
2009
Springer
14 years 4 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
EJC
2008
13 years 4 months ago
2008
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...