721 search results - page 71 / 145 » Bounds on the k-domination number of a graph |
150
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
156
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
220
click to vote
IJCAI
1989
15 years 7 months ago
1989
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...
158
click to vote
CPC
2007
15 years 6 months ago
2007
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular...
164
click to vote
ISPAN
2005
IEEE
15 years 12 months ago
2005
IEEE
For a given graph G = (V, E) and a positive integer k, the super line graph of index k of G is the graph Sk(G) which has for vertices all the k-subsets of E(G), and two vertices S...