Results 11 to 20 of about 7,293,468 (349)
The complexity of dominating set reconfiguration [PDF]
Theoretical Computer Science, 2015 Suppose that we are given two dominating sets $D_s$ and $D_t$ of a graph $G$ whose cardinalities are at most a given threshold $k$. Then, we are asked whether there exists a sequence of dominating sets of $G$ between $D_s$ and $D_t$ such that each dominating set in the sequence is of cardinality at most $k$ and can be obtained from the previous one by ...
Takehiro Ito +6 more
openaire +5 more sources
Operations Research Letters, 2004 This paper presents several representation theorems for the solubility of three cost allocation problems, which are presented as cooperative games. In each problem, a graph \(G = (V, E)\) is given along with a cost function: given \(S \subseteq V\), \(c(S)\) is the cost of \(k\)-dominating the vertices in \(S\), i.e., building a set \(K \subseteq V ...
Velzen, S. van
openaire +8 more sources
Distributed Dominating Set Approximations beyond Planar Graphs [PDF]
ACM Trans. Algorithms, 2017 The Minimum Dominating Set (MDS) problem is a fundamental and challenging problem in distributed computing. While it is well known that minimum dominating sets cannot be well approximated locally on general graphs, in recent years there has been much ...
S. A. Amiri, S. Schmid, S. Siebertz
semanticscholar +3 more sources
Distributed dominating sets on grids [PDF]
2013 American Control Conference, 2013 10 pages, 9 figures, accepted in ACC ...
Elaheh Fata +2 more
openaire +5 more sources
A Linear Kernel for Planar Total Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A total dominating set of a graph $G=(V,E)$ is a subset $D \subseteq V$ such that every vertex in $V$ is adjacent to some vertex in $D$. Finding a total dominating set of minimum size is NP-hard on planar graphs and W[2]-complete on general graphs when ...
Valentin Garnero, Ignasi Sau
doaj +3 more sources
The Constant Inapproximability of the Parameterized Dominating Set Problem [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2015 We prove that there is no fpt-algorithm that can approximate the dominating set problem with any constant ratio, unless FPT = W[1]. Our hardness reduction is built on the second author's recent W[1]-hardness proof of the biclique problem [25].
Yijia Chen, Bingkai Lin
semanticscholar +4 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
Approximating minimum independent dominating sets in wireless networks [PDF]
, 2008 We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth.
Johann L. Hurink, Tim Nieberg
openalex +9 more sources
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
An order-based algorithm for minimum dominating set with application in graph mining [PDF]
Information Sciences, 2017 Dominating set is a set of vertices of a graph such that all other vertices have a neighbour in the dominating set. We propose a new order-based randomised local search (RLS$_o$) algorithm to solve minimum dominating set problem in large graphs ...
David Chalupa
semanticscholar +3 more sources