… embedded outerplanar graph… total, we spend O(scan(N + I)) I/Os. The space requirements
are clearly bounded by O((N + I)/B) blocks of external memory, as this is the maximum number …

… A set of vertices of a graph G is a total dominating set if every … We say that a total dominating
set D is a total outer k-… all total outer k-independent dominating sets is the total outer …

… outer-independent, the total outer-independent and the double outer-independent domination
numbers of graphs … K 2 t by removing a perfect matching of it. Thus, we observe that γ t o i ( …

… Hence the best situation for a location with no army is to be … give exact values of the
parameter for some classes of graphs … Now to obtain a graph G, we add edges c j w i if x i ∈ C j . …

… In our reduction, we add more vertices to the bipartite graph which arises naturally from an
instance of the Min-Set-Cover problem without increasing the maximum degree of the entire …

… implying that our algorithm is optimal to within a polylogarithmic factor. … If the dual of G is a
path, then an optimal (nlogn) time … A drawing of a graph G = (V,E) is a function which maps the …

… The best protection for a vulnerable location is to be completely surrounded only by …
Clearly, any outer-independent Roman dominating function on a graph G is an OIIDF of G …

… optimal encoder and decoder for each edge. For general directed acyclic graphs, we provide
an outer … each cut, and describe examples where this outer bound is tight. Next, we address …

… optimization to be over an outer bound on the marginal polytope and also bound the entropy
function… In Figure 1 we show part of the full projection graph corresponding to one edge (i, j)…

… that reduce or eliminate the use of the outer loop optimization and may allow us to find good
… function working at 20 bits tossing 3-regular graphs. The number of edges in each graph is …