187 search results - page 19 / 38 » The Number of Independent Sets in a Grid Graph |
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
DAM
2008
13 years 7 months ago
2008
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
TDSC
2010
13 years 6 months ago
2010
—Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical informati...
FCS
2009
13 years 5 months ago
2009
- A representation for a set is defined to be symmetric if the space required for the representation of the set is the same as the space required for representation of the set'...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...