1729 search results - page 141 / 346 » On Bounds for the k-Partitioning of Graphs |
187
click to vote
ACTA
2007
15 years 6 months ago
2007
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
208
click to vote
ALGORITHMICA
1998
15 years 6 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
201
click to vote
SIAMDM
2010
15 years 4 months ago
2010
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
180
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators [WX08]. Building on their construction, we prese...
190
click to vote
MASS
2010
15 years 1 months ago
2010
Abstract--Recent years have witnessed the emergence of numerous new Internet services for mobile users. Supporting mobile applications via public WiFi networks has received signifi...