Show simple item record

dc.contributor.authorDapena, Adriana
dc.contributor.authorIglesia, Daniele
dc.contributor.authorVázquez Araújo, Francisco Javier
dc.contributor.authorCastro-Castro, Paula-María
dc.date.accessioned2020-03-04T15:22:08Z
dc.date.available2020-03-04T15:22:08Z
dc.date.issued2019-11-29
dc.identifier.citationDapena, A.; Iglesia, D.; Vazquez-Araujo, F.J.; Castro, P.M. New Computation of Resolving Connected Dominating Sets in Weighted Networks. Entropy 2019, 21, 1174.es_ES
dc.identifier.issn1099-4300
dc.identifier.urihttp://hdl.handle.net/2183/25109
dc.description.abstract[Abstract] 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 set (CDS) is a connected subset of vertices of G selected to guarantee that all vertices in the graph are connected to vertices in the CDS. The connected dominating set with minimum cardinality, or minimum CDS (MCDS), is an adequate virtual backbone for information interchange in a network. When distinct vertices of G have also distinct representations with respect to a subset of vertices in the MCDS, it is said that the MCDS includes a resolving set (RS) of G. With this work, we explore different strategies to find the RCDS with minimum cardinality in complex networks where the vertices have different importances.es_ES
dc.description.sponsorshipXunta de Galicia; ED431C 2016-045es_ES
dc.description.sponsorshipXunta de Galicia; ED341D R2016/012es_ES
dc.description.sponsorshipXunta de Galicia; ED431G/01es_ES
dc.description.sponsorshipAgencia Estatal de Investigación de España; TEC2013-47141-C4-1-Res_ES
dc.description.sponsorshipAgencia Estatal de Investigación de España; TEC2015-69648-REDCes_ES
dc.description.sponsorshipAgencia Estatal de Investigación de España; TEC2016-75067-C4-1-Res_ES
dc.language.isoenges_ES
dc.publisherM D P I AGes_ES
dc.relation.urihttps://doi.org/10.3390/e21121174es_ES
dc.rightsAtribución 3.0 Españaes_ES
dc.rights.urihttp://creativecommons.org/licenses/by/3.0/es/*
dc.subjectComplex networkses_ES
dc.subjectConnected dominating setes_ES
dc.subjectGraph entropyes_ES
dc.subjectResolving setes_ES
dc.subjectVertex importancees_ES
dc.titleNew Computation of Resolving Connected Dominating Sets in Weighted Networkses_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.rights.accessinfo:eu-repo/semantics/openAccesses_ES
UDC.journalTitleEntropyes_ES
UDC.volume21es_ES
UDC.issue12es_ES
UDC.startPage1174es_ES
dc.identifier.doi10.3390/e21121174


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record