Results 21 to 30 of about 252,358 (178)
Linear Kernel for Planar Connected Dominating Set [PDF]
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lokshtanov, D., Mnich, M., Saurabh, S.
openaire +2 more sources
Connected Dominating Sets [PDF]
, 2009 Wireless sensor networks (WSNs) are now widely used in many applications. However, routing in WSNs is very challenging due to the inherent characteristics that distinguish these networks from other wireless networks. The concept of hierarchical routing is widely used to perform energy-efficient routing in WSNs.
Yiwei Wu, Yingshu Li
openaire +1 more source
Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set [PDF]
, 2014 This paper presents a near-optimal distributed approximation algorithm for the minimum-weight connected dominating set (MCDS) problem. The presented algorithm finds an $O(\log n)$ approximation in $\tilde{O}(D+\sqrt{n})$ rounds, where $D$ is the network ...
F. Dai +6 more
core +2 more sources
Algorithmic complexity of secure connected domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a simple, undirected, and connected graph. A connected (total) dominating set is a secure connected (total) dominating set of G, if for each there exists such that and is a connected (total) dominating set of G. The minimum cardinality of a secure
J. Pavan Kumar +2 more
doaj +1 more source
Kernelization and Sparseness: the case of Dominating Set [PDF]
, 2015 We prove that for every positive integer $r$ and for every graph class $\mathcal G$ of bounded expansion, the $r$-Dominating Set problem admits a linear kernel on graphs from $\mathcal G$.
Drange, Pål Grønås +11 more
core +2 more sources
Lossy Kernels for Connected Dominating Set on Sparse Graphs [PDF]
, 2018 For alpha > 1, an alpha-approximate (bi-)kernel for a problem Q is a polynomial-time algorithm that takes as input an instance (I, k) of Q and outputs an instance (I\u27,k\u27) (of a problem Q\u27) of size bounded by a function of k such that, for every ...
Eiben, Eduard +4 more
core +2 more sources
Connected Dominating Sets in Triangulations
, 2023 We show that every $n$-vertex triangulation has a connected dominating set of size at most $10n/21$. Equivalently, every $n$ vertex triangulation has a spanning tree with at least $11n/21$ leaves. Prior to the current work, the best known bounds were $n/2$, which follows from work of Albertson, Berman, Hutchinson, and Thomassen (J. Graph Theory \textbf{
Bose, Prosenjit +4 more
openaire +2 more sources
Post-disaster reconstruction algorithm of wireless ad hoc network in coal mine
Gong-kuang zidonghua, 2022 Mine accidents often lead to partial communication link damage and communication network connectivity deterioration. Using residual nodes and limited new nodes, reconstructing coal mine rescue network by constructing local virtual backbone network can ...
HU Qingsong, WANG Shengnan
doaj +1 more source
The $k$-Dominating Graph [PDF]
, 2013 Given a graph $G$, the $k$-dominating graph of $G$, $D_k(G)$, is defined to be the graph whose vertices correspond to the dominating sets of $G$ that have cardinality at most $k$.
Haas, Ruth, Seyffarth, Karen
core +3 more sources
Reconfiguration of Dominating Sets [PDF]
, 2014 We explore a reconfiguration version of the dominating set problem, where a dominating set in a graph $G$ is a set $S$ of vertices such that each vertex is either in $S$ or has a neighbour in $S$.
A.E. Mouawad +16 more
core +1 more source