In this paper we focus on the issue related to finding the resolving connected dominating sets (RCDSs) of a graph, denoted by G. The connected dominating ...
scholar.google.com › citations
This work explores different strategies to find the RCDS with minimum cardinality in complex networks where the vertices have different importances.
With this work, we explore different strategies to find the RCDS with minimum cardinality in complex networks where the vertices have different importances.
In this paper we focus on the issue related to finding the resolving connected dominating sets (RCDSs) of a graph, denoted by G. The connected dominating ...
New Computation of Resolving Connected Dominating Sets in ...
www.linkedin.com › pulse › new-compu...
Dec 5, 2019 · New Computation of Resolving Connected Dominating Sets in Weighted Networks Adriana Dapena, Daniel Iglesia, Francisco J. Vazquez-Araujo and ...
New Computation of Resolving Connected Dominating Sets in Weighted Networks. Overview of attention for article published in Entropy, November 2019. Altmetric ...
New Computation of Resolving Connected Dominating Sets in Weighted Networks ; dc.contributor.author, Castro-Castro, Paula-María ; dc.date.accessioned, 2020-03- ...
... New Computation of Resolving Connected Dominating Sets in Weighted Networks. Entropy 2019, 21, 1174. https://doi.org/10.3390/e21121174. AMA Style. Dapena A ...
New computation of resolving connected dominating sets in weighted networks ; ISSN · 1099-4300 ; Ano de publicación · 2019 ; Volume · 21 ; Número · 12 ; Tipo · Artigo.
The minimum connected dominating set (MCDS) problem is to find a CDS with the minimum size. MCDS is a well-known combinatorial optimization problem with ...