70 search results - page 1 / 14 » The complexity of counting graph homomorphisms |
RSA
2000
13 years 4 months ago
2000
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...
JACM
2007
13 years 4 months ago
2007
SIAMDM
2008
13 years 4 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...