231 search results - page 25 / 47 » The Number of Independent Sets in a Regular Graph |
160
click to vote
FOCS
2009
IEEE
16 years 25 days 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...
155
click to vote
DAM
2008
15 years 6 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...
187
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Although there are a large number of thesauri for the biomedical domain many of them lack coverage in terms and their variant forms. Automatic thesaurus construction b...
122
click to vote
CPC
2006
15 years 6 months ago
2006
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
149
click to vote
NIPS
2008
15 years 7 months ago
2008
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...