Results 321 to 330 of about 7,194,939 (348)
Some of the next articles are maybe not open access.
Chapter 6 Contagion and Dominating Sets
2006Abstract Each agent of a finite population interacts strategically with each of his neighbours on a graph. All agents have the same pair of available actions. In every period, each agent chooses a particular action if at least a proportion p of his neighbours has chosen this action in the previous period.
Durieu, Jacques +2 more
openaire +3 more sources
Dominant-set clustering: A review
European Journal of Operational Research, 2017Abstract Clustering refers to the process of extracting maximally coherent groups from a set of objects using pairwise, or high-order, similarities. Traditional approaches to this problem are based on the idea of partitioning the input data into a predetermined number of classes, thereby obtaining the clusters as a by-product of the partitioning ...
Samuel Rota Bulò, Marcello Pelillo
openaire +3 more sources
On Dominating Sets and Independent Sets of Graphs
Combinatorics, Probability and Computing, 1999For a graph G on vertex set V = {1, …, n} let k = (k1, …, kn) be an integral vector such that 1 [les ] ki [les ] di for i ∈ V, where di is the degree of the vertex i in G. A k-dominating set is a set Dk ⊆ V such that every vertex i ∈ V[setmn ]Dk has at least ki neighbours in Dk.
Jochen Harant +2 more
openaire +2 more sources
VERY EXCELLENT DOMINATING WEAKLY CONNECTED SET DOMINATING SETS [PDF]
Advances in Mathematics: Scientific Journal, 2020 M. Davamani Christober +1 more
openaire +1 more source
Counting Minimal Dominating Sets
2017A dominating set D in a graph is a subset of its vertex set such that each vertex is either in D or has a neighbour in D. From [M.M. Kante, V. Limouzy, A. Mary and L. Nourine, On the Enumeration of Minimal Dominating Sets and Related Notions, SIDMA 28(4):1916–1929 (2014)] we know that the counting (resp.
Kanté, Mamadou Moustapha, Uno, Takeaki
openaire +3 more sources
Safe sets and in-dominating sets in digraphs
Discrete Applied MathematicsA non-empty subset S of the vertices of a digraph D is a safe set if (i) for every strongly connected component M of D−S, there exists a strongly connected component N of D[S] such that there exists an arc from M to N; and (ii) for every strongly connected component M of D−S and every strongly connected component N of D[S], we have |M|≤|N| whenever ...
Bai, Yandong +4 more
openaire +2 more sources
Minimum connected dominating set based RSU allocation for smartCloud vehicles in VANET
Cluster Computing, 2018A. Chinnasamy +3 more
semanticscholar +1 more source
An algorithm based on ant colony optimization for the minimum connected dominating set problem
Applied Soft Computing, 2019S. Bouamama +2 more
semanticscholar +1 more source
Efficient heuristic algorithms for positive-influence dominating set in social networks
Conference on Computer Communications Workshops, 2018F. Abu-Khzam, Karine Lamaa
semanticscholar +1 more source
Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors
ACM Trans. Algorithms, 2018F. Fomin +3 more
semanticscholar +1 more source