211 search results - page 4 / 43 » Counting the number of independent sets in chordal graphs |
SIAMDM
1998
13 years 7 months ago
1998
If f(m, n) is the (vertex) independence number of the m × n grid graph, then we show that the double limit η = def limm,n→∞ f(m, n) 1 mn exists, thereby refining earlier res...
IPL
2006
13 years 7 months ago
2006
We present a matrix multiplication based algorithm for counting the number of (induced) occurrences of a fixed r-uniform hypergraph in a larger hypergraph. In many cases, the runn...
CPC
2010
13 years 4 months ago
2010
CORR
2011
Springer
13 years 2 months ago
2011
Springer
GC
2011
Springer
13 years 2 months ago
2011
Springer