1729 search results - page 13 / 346 » On Bounds for the k-Partitioning of Graphs |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
104
click to vote
GC
2002
Springer
14 years 9 months ago
2002
Springer
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
107
click to vote
ISAAC
2010
Springer
14 years 7 months ago
2010
Springer
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
171
click to vote
AMW
2011
14 years 1 months ago
2011
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...
103
click to vote
MP
2010
14 years 8 months ago
2010
The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...