Results 11 to 20 of about 5,027,974 (207)
Eternal Domination: Criticality and Reachability [PDF]
Discussiones Mathematicae Graph Theory, 2017 We show that for every minimum eternal dominating set, D, of a graph G and every vertex v ∈ D, there is a sequence of attacks at the vertices of G which can be defended in such a way that an eternal dominating set not containing v is reached.
Klostermeyer William F. +1 more
doaj +4 more sources
A linear Algorithm For The Eternal Feedback Vertex Set on Interval Graphs*
, 2023 International audienceThe Eternal Feedback Vertex Set problem is a new model of protecting graphs using mobile guards, which is usually modeled using a two-players game; a defender and an attacker.
Kheddouci, Hamamache +2 more
core +7 more sources
Approximation hardness of dominating set problems in bounded degree graphs [PDF]
, 2008 We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower bounds for various
Chlebikova, Janka +4 more
core +1 more source
Positive Influence Dominating Set in E-Learning Social Networks [PDF]
, 2011 In recent years, the development of E-learning is rapid. Learning efficiency can be greatly improved if E-learning users' social networks properties can be effectively utilized. However, the nodes in most research models are the same type.
Hua Wang +7 more
core +1 more source
dib-lab/2022-dominating-set-differential-abundance-example: preprint version 1.0
, 2022 A reproducible example demonstrating an example workflow for performing dominating set differential abundance ...
Taylor Reiter
core +1 more source
Eternal m- Security Subdivision Numbers in Graphs
پژوهشهای ریاضی, 2022 Let be a simple graph with vertex set and edges set . A set is a dominating set if every vertex in is adjacent to at least one vertex in . An eternal 1-secure set of a graph G is defined as a dominating set such that for any positive integer k and ...
Maryam Atapour
doaj
a-t-0/spiking-neural-network-of-dominating-set-approximation: v1.0.0
, 2021 <p>Neuromorphic computing is a promising new computational paradigm that may provide energy-lean solutions to algorithmic challenges such as graph problems.
Victoria Bosch +3 more
core +1 more source
Finding a weighted positive influence dominating set in e-learning social networks [PDF]
, 2013 Online social network has developed significantly in recent years. Most of current research has utilized the property of online social network to spread information and ideas.
Zhu, Guohun +4 more
core +1 more source
Positive Influence Dominating Set Games
, 2014 Motivated by applications in social networks, a new type of dominating set named Positive Influence Dominating Set (PIDS) has been studied in the literature. In this paper, we investigate cooperative cost games arising from PIDS problem on social network
Jianming Yong +15 more
core +1 more source
Harnessing Phase Separation for the Development of High‐Performance Hydrogels
Advanced Science, EarlyView.ABSTRACT Hydrogels are indispensable for the development of next‐generation bioelectronics, soft robotics, and biomedical devices, where their mechanical properties determine performance and reliability. Among strategies to enhance hydrogel mechanics, phase separation enables controlled heterogeneity resulting in gel networks that are reinforced by ...
Yue Shao +3 more
wiley +1 more source