minimal dominating set
Neighborhood Inclusions for Minimal Dominating Sets Enumeration: Linear and Polynomial Delay Algorithms in P_7-Free and P_8-Free Chordal Graphs
... Also yb, zx, cy 6∈ E(G) as y and z are private neighbors of x and c. Since G is chordal, u 00 u 0 uvbxyzc induces P 9 , concluding the second part of the proposition in this case. Let us now consider the other case w 6∈ ...
17
Enumerating Minimal Dominating Sets in Triangle-Free Graphs
... partial minimal dominating sets by adding the neighborhoods back one after the ...partial minimal dominating set to a new neighborhood is closely related to the enumeration of ...
13
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
... finite set and E Ď 2 V is called the set of ...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 ...
12
On the Enumeration of Minimal Dominating Sets and Related Notions
... one minimal transversal (Corollary 3), and since each vertex of a graph appears in at least one minimal dominating set (Corollary 7), we have V pGq “ V p ...
15
Dominating the Erdos-Moser theorem in reverse mathematics
... Ramsey-type theorems satisfy one common core combinatorial property: given an instance I of a principle P, for every infinite set X ⊆ N, there is a solution of Y ⊆ X of I. This property makes Ramsey-type ...
37
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
Identifying and locating-dominating codes in (random) geometric networks
... vertex set V and an edge vw ∈ E(G(V, r)) whenever kv − w k< ...a set V ⊆ R 2 and a positive real r such that H = G(V, r) is a unit disk graph, and (V, r) is a realisation (or an embedding) of ...
29
A polyhedral approach to locating-dominating sets in graphs
... locating-dominating set problem is a special domination problem, challenging both from a theoretical and a computational point of ...locating-dominating set problem from a polyhedral point of ...
7
A levet set model for the numerical modeling of composite delamination with nonconforming mesh and minimal remeshing
... Level set update In order to update the level set field which is defined on the whole domaine Ω, the velocity field computed on a smaller domain should be ...level set values are used to sort the ...
10
A method for eternally dominating strong grids
... 1 Introduction 1.1 Background The graph security model of eternal domination was introduced in the 1990’s with the study of the military strategy of Emperor Constantine for defending the Roman Empire in a mathematical ...
12
Exact Algorithms for Dominating Clique Problems
... min dominating clique and max dominating clique, since any such algorithm should first solve existing dominating clique that is ...min dominating clique and max dominating clique by ...
13
Dominating sets reconfiguration under token sliding
... Any dominating set of that size necessarily contains the central ...independent set, there can be no question of superposing two tokens, as two tokens cannot be adjacent in the first ...for ...
18
Metabolomic characterization of sunflower leaf allows discriminating genotype groups or stress levels with a minimal set of metabolic markers
... marker set composed of eight biochemical variables: total free amino acids, citrate, glycine-betaine, myo-inositol, sucrose, glucose, total proteins and ...
15
Lower Bounds and Algorithms for Dominating Sets in Web Graphs
... Unité de recherche INRIA Sophia Antipolis 2004, route des Lucioles - BP 93 - 06902 Sophia Antipolis Cedex France Unité de recherche INRIA Futurs : Parc Club Orsay Université - ZAC des Vi[r] ...
30
La Chose et l'art minimal : une approche du réel
... 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] ...
353
Dominating surface group representations and deforming closed anti-de Sitter 3-manifolds
... strictly dominating a given representation ρ, an by Dom(S, Isom(M )) the domain of pairs (j, ρ) ∈ T (S) × Rep(S, Isom(M )) such that j strictly dominates ...
30
Edge Integration Using Minimal Geodesics
... level set of a surface allowing it to change its topology ...of minimal path estimation on a surface [13], we give an evolution scheme that provides at each image pixel an output of the energy along the ...
19
Minimal Synchrony for Byzantine Consensus
... timely [12, 14] (the “ +1” comes from the fact that it is assumed that each process has a “virtual” input/output channel from itself to itself, which is always timely). Considering asynchronous systems with Byzantine ...
16
Unique (Optimal) Solutions: Complexity Results for Identifying and Locating-Dominating Codes
... the set of problems which can be solved by a polynomial (time) algorithm, and the class NP the set of problems which can be solved by a nondeterministic polynomial ...
37