It is consistent (relative to ZFC) that each union of max{b, g} many families in the Baire space which are not finitely dominating is not dominating. In particular, it is consist...
Abstract. Planning-specific heuristics for SAT have recently been shown to produce planners that match best earlier ones that use other search methods, including the until now dom...
Complexity is one of the most important problems facing microarchitects. It is exacerbated by the application of optimizations, by scaling to higher issue widths and, in general, ...
We prove that for every tree T of order at least 2 and every minimum dominating set D of T which contains at most one endvertex of T, there is an independent dominating set I of T...
Let G = (V, E) be a graph. A set S V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V - S is adjacent to a vertex in V - S....
Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Jo...