231 search results - page 16 / 47 » The Number of Independent Sets in a Regular Graph |
ACTA
2008
14 years 12 months ago
2008
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
103
click to vote
ICIP
2008
IEEE
15 years 6 months ago
2008
IEEE
In the area of depth estimation from images an interesting approach has been structure recovery from defocus cue. Towards this end, there have been a number of approaches [4, 6]. ...
DM
2007
14 years 11 months ago
2007
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the inde...
AAAI
1996
15 years 1 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
122
click to vote
IWPEC
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...