3 search results - page 1 / 1 » Fast Exponential-Time Algorithms for the Forest Counting in ... |
CATS
2007
13 years 6 months ago
2007
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
DISOPT
2007
13 years 5 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...