Dominating Set Knapsack: Profit Optimization on Dominating Sets
arXiv.orgIn a large-scale network, we want to choose some influential nodes to make a profit by paying some cost within a limited budget so that we do not have to spend more budget on some nodes adjacent to the chosen nodes; our problem is the graph-theoretic ...
Sipra Singh
semanticscholar +3 more sources
Dominating Set Algorithms for Wireless Sensor Networks Survivability
IEEE Access, 2018 Limited energy of the sensors is one of the key issues towards realizing a reliable wireless sensor network (WSN), which can survive under the emerging WSN applications.
Tayler Pino +2 more
doaj +2 more sources
Spanning trees with disjoint 2 dominating and 2-dominating sets
Discussiones Mathematicae Graph Theory, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mateusz Miotk, Paweł Żyliński
openalex +4 more sources
Characterizing minimal point set dominating sets
AKCE International Journal of Graphs and Combinatorics, 2016 A set D of vertices in a graph G=(V,E) is said to be a point-set dominating set (or, in short, psd-set) of G if for every subset S of V−D there exists a vertex v∈D such that the subgraph 〈S∪{v}〉 is connected; the set of all psd-sets of G will be denoted ...
Purnima Gupta, Rajesh Singh, S. Arumugam
doaj +2 more sources
Improved Location Estimation in Wireless Sensor Networks Using a Vector-Based Swarm Optimized Connected Dominating Set. [PDF]
Sensors (Basel), 2019 Kumar G +6 more
europepmc +3 more sources
Run for Cover: Dominating Set via Mobile Agents [PDF]
ALGOWIN, 2023 Research involving computing with mobile agents is a fast-growing field, given the advancement of technology in automated systems, e.g., robots, drones, self-driving cars, etc.
P. Chand +2 more
semanticscholar +1 more source
A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems [PDF]
arXiv.org, 2022 A graph vertex-subset problem defines which subsets of the vertices of an input graph are feasible solutions. We view a feasible solution as a set of tokens placed on the vertices of the graph.
N. Bousquet +3 more
semanticscholar +1 more source
Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation [PDF]
International/Italian Conference on Algorithms and Complexity, 2021 An upper dominating set is a minimal dominating set in a graph. In the \textsc{Upper Dominating Set} problem, the goal is to find an upper dominating set of maximum size.
L. Dublois, M. Lampis, V. Paschos
semanticscholar +1 more source
Efficient Domination In Fuzzy Graphs and Intuitionistic Fuzzy Graphs in Strong and weak forms [PDF]
E3S Web of Conferences, 2023 This work defines the concepts of strong efficient dominating set and intuitionistic fuzzy graph. We also introduce an intuitionistic fuzzy graph and a strong efficient dominating number of fuzzy graphs.
S Rajeev Gandhi +4 more
doaj +1 more source
New Algorithms for Mixed Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A mixed dominating set is a collection of vertices and edges that dominates all vertices and edges of a graph. We study the complexity of exact and parameterized algorithms for \textsc{Mixed Dominating Set}, resolving some open questions.
Louis Dublois +2 more
doaj +1 more source