Jan 30, 2020 · In this paper, we prove that the SCDM problem is NP-complete for doubly chordal graphs, a subclass of chordal graphs.
The Minimum Secure. Connected Dominating Set (MSCDS) problem is to find a secure connected dominating set of minimum size in the input graph. We propose a (∆(G)+ ...
Algorithmic Aspects of Secure Connected Domination in Graphs 3. Connected Dominating Set (MSCDS) problem is to find a SCDS of minimum size in the input graph.
Oct 22, 2024 · Given a graph G and a positive integer k, the Secure Connected Domination (SCDM) problem is to check whether G has a secure connected dominating ...
This paper proposes a ( (G)+1)-approximation algorithm for MSCDS, where (G) is the maximum degree of the input graph G and proves that MSC DS cannot be ...
Apr 16, 2021 · In this paper, we prove that the 2-SDM problem is NP-complete for planar graphs and doubly chordal graphs, a subclass of chordal graphs.
Missing: Connected | Show results with:Connected
Abstract. Let G = (V,E) be a simple, undirected and connected graph. A con- nected dominating set S Ç V is a secure connected dominating set of G,.
In this paper, we consider algorithmic aspects of the MSDS problem in UDGs. We first show that the decision version of the MSDS problem is NP-complete in grid ...
May 28, 2020 · In this paper, we show that the decision problems corresponding to secure connected domination number and secure total domination number are NP-complete
Given a graph G and a positive integer k, the Secure Connected Domination (SCDM) problem is to check whether G has a secure connected dominating set of size at ...