Vertex Covering and Strong Covering of Flower Like Network Structures
نویسندگان
چکیده
منابع مشابه
Capacitated vertex covering
In this paper we study the capacitated vertex cover problem, a generalization of the well-known vertex cover problem. Given a graph G = (V ,E) with weights on the vertices, the goal is to cover all the edges by picking a cover of minimum weight from the vertices. When we pick a copy of a vertex, we pay the weight of the vertex and cover up to a pre-specified number of edges incident on this ver...
متن کاملStrong covering without squares
The study of “covering lemmas” started with Jensen [DeJe] who proved in 1974–5 that in the absence of 0 there is a certain degree of resemblance between V and L. More precisely, if 0 does not exist then for every set of ordinals X there exists a set of ordinals Y ∈ L such that X ⊆ Y and V 2 |Y | = max{|X|,א1}. There is no hope of covering countable sets by countable ones in general, because doi...
متن کاملAn Application of Strong Covering
(1) If N < ω, then (†N ) is consistent, relative to the consistency of ZFC. (2) If (†ω), then 0 exists. (3) If 0 exists, then (†η) holds for all η. The last of these is easy. Let I be the club class of Silver indiscernibles provided by 0, let κ = ω1, and let Cδ = I ∩ [ωδ+1, ωδ+2), for δ < η. Claim (2) uses Strong Covering and a bit of Jensen’s fine structure theory for L. Claim (1) is proved us...
متن کاملComputational Complexity of Covering Three-Vertex Multigraphs
A covering projection from a graph G to a graph H is a mapping of the vertices of G to the vertices of H such that, for every vertex v of G, the neighborhood of v is mapped bijectively to the neighborhood of its image. Moreover, if G and H are multigraphs, then this local bijection has to preserve multiplicities of the neighbors as well. The notion of covering projection stems from topology, bu...
متن کاملOnline Myopic Network Covering
Efficient marketing or awareness-raising campaigns seek to recruit n influential individuals – where n is the campaign budget – that are able to cover a large target audience through their social connections. So far most of the related literature on maximizing this network cover assumes that the social network topology is known. Even in such a case the optimal solution is NP-hard. In practice, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2016
ISSN: 1877-0509
DOI: 10.1016/j.procs.2016.05.143