Minimal dominating sets
Enumerating Minimal Dominating Sets in Triangle-Free Graphs
... Because dominating sets are among the most studied objects in graph theory and algorithms, their enumeration (and counting) have attracted an increasing attention over the past 10 ...enumerating ...
13
On the Enumeration of Minimal Dominating Sets and Related Notions
... of minimal dominating sets of graphs (Dom-Enum problem for short) is closely related to the well-known Trans-Enum problem in hypergraphs, which consists in enumerating the set of minimal ...
15
Neighborhood Inclusions for Minimal Dominating Sets Enumeration: Linear and Polynomial Delay Algorithms in P_7-Free and P_8-Free Chordal Graphs
... of minimal dominating sets with redundant vertices form an independence system and an accessible set system in P 7 -free and P 8 -free chordal ...
17
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
... inclusion-wise minimal hitting sets of hyper-edges of a given hypergraph (the Trans-Enum problem) is a fifty years old open problem, and up to now there are few tractable examples of hypergraph ...
12
Witness sets
... Let us now say that a code has the w-witness property, or is a w-witness code , if every one of its codewords has a witness set of size w. Our concern is to study the maximum possible cardinality f (n, w) of a w-witness ...
10
S-automatic sets
... In particular, the diagonal set D = {(n, n) | n ∈ N} is not recognizable. However, the set D is clearly a 1-automatic subset of N 2 . So we see that for d > 1, the class of 1-automatic sets corresponds neither ...
64
Identifying and locating-dominating codes in (random) geometric networks
... j = xv1v2 . . . v5k C j, where x belongs to the variable-gadget Li. If the literal to which x corresponds is true, according to the satisfying assignment A, then x ∈ C and we add to C the vertices v5r−2 and v5r for r ∈ ...
29
Specular sets
... The following result is the counterpart for uniformly recurrent specular sets. 306[r] ...
12
Specular sets
... In Section 5 we recall the definition of a linear involution introduced in [15] and we show that the natural coding of a linear involution without connections is a specular set (Theorem 5.9). In Section 6 we introduce ...
52
Memory Efficient Self-Stabilizing k-Independent Dominating Set Construction
... obtained dominating set contains at most ⌈n/(k + 1)⌉ ...k-dominating sets : the obtained dominating set contains at most 1 + ⌊(n − 1)/(k + 1)⌋ ...
17
Dominating the Erdos-Moser theorem in reverse mathematics
... the sets computable by every solution to a given instance I of P are precisely the hyperarithmetical ...hyperarithmetical sets are precisely the sets S admitting a modulus, namely, a function f such ...
37
Fast self-stabilizing k-independent dominating set construction
... independent dominating set, k-dominating set, k-independent set 1 Introduction In this paper, we consider the problem of computing a distance-k inde- pendent dominating set in a self-stabilizing ...
11
Minimal CRE-PGD
... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...
2
Dominating factor of strain-induced crystallization in natural rubber
... In the present paper, we evaluate the contribution of entropy change due to stretching of polymer chains in promoting crystal nucleation in cross-linked natural rubber (NR) and demonstra[r] ...
8
Specular Sets
... 0 (f ω (α)). Odd and even words. We introduce a notion which plays, as we shall see, an important role in the study of specular sets. Let S be a specular set. Since a specular set is biextendable, any letter a ∈ A ...
13
Sparse sets
... In other terms, we are looking for a matrix of non-negative reals (a distribution on A × B) that has given sums for all rows and columns. This task can be reformulated in terms of network flows. Indeed, consider a ...
12
On the complexity of Independent Dominating Set with Obligations in graphs
... of dominating all the vertices of the ...Independent Dominating set with Obligation (PIDO ) ...and dominating at least 3p|V | − 2 vertices of G is NP - complete, even if G is a collection of disjoint ...
23
Modèle minimal pour les dunes transverses.
... Résumé : Nous présentons ici un modèle minimal pour décrire la stabilité des dunes transverses. Ce modèle qui s’inspire de celui proposé par NIIYA et al. (2010) est basé sur une représentation simplifiée d’une ...
9
Words guaranteeing minimal image
... even for small deficiencies and alphabet sizes. As for our “benchmark”, that is, a word over a two-letter alphabet that guarantees minimal image in T 5 , Table 3 indicates that there is such a word of length 4872. ...
15
Words guaranteeing minimal image
... Thus, we see that the validity of the generalized ˇ Cern´ y conjecture would have as an immediate consequence an easy construction for words guaran- teeing minimum image, and obviously t[r] ...
19