Mostrar o rexistro simple do ítem
New Computation of Resolving Connected Dominating Sets in Weighted Networks
dc.contributor.author | Dapena, Adriana | |
dc.contributor.author | Iglesia, Daniel I. | |
dc.contributor.author | Vázquez Araújo, Francisco Javier | |
dc.contributor.author | Castro-Castro, Paula-María | |
dc.date.accessioned | 2020-03-04T15:22:08Z | |
dc.date.available | 2020-03-04T15:22:08Z | |
dc.date.issued | 2019-11-29 | |
dc.identifier.citation | Dapena, 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.issn | 1099-4300 | |
dc.identifier.uri | http://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.sponsorship | Xunta de Galicia; ED431C 2016-045 | es_ES |
dc.description.sponsorship | Xunta de Galicia; ED341D R2016/012 | es_ES |
dc.description.sponsorship | Xunta de Galicia; ED431G/01 | es_ES |
dc.description.sponsorship | Agencia Estatal de Investigación de España; TEC2013-47141-C4-1-R | es_ES |
dc.description.sponsorship | Agencia Estatal de Investigación de España; TEC2015-69648-REDC | es_ES |
dc.description.sponsorship | Agencia Estatal de Investigación de España; TEC2016-75067-C4-1-R | es_ES |
dc.language.iso | eng | es_ES |
dc.publisher | M D P I AG | es_ES |
dc.relation.uri | https://doi.org/10.3390/e21121174 | es_ES |
dc.rights | Atribución 3.0 España | es_ES |
dc.rights.uri | http://creativecommons.org/licenses/by/3.0/es/ | * |
dc.subject | Complex networks | es_ES |
dc.subject | Connected dominating set | es_ES |
dc.subject | Graph entropy | es_ES |
dc.subject | Resolving set | es_ES |
dc.subject | Vertex importance | es_ES |
dc.title | New Computation of Resolving Connected Dominating Sets in Weighted Networks | es_ES |
dc.type | info:eu-repo/semantics/article | es_ES |
dc.rights.access | info:eu-repo/semantics/openAccess | es_ES |
UDC.journalTitle | Entropy | es_ES |
UDC.volume | 21 | es_ES |
UDC.issue | 12 | es_ES |
UDC.startPage | 1174 | es_ES |
dc.identifier.doi | 10.3390/e21121174 |
Ficheiros no ítem
Este ítem aparece na(s) seguinte(s) colección(s)
-
GI-GTEC - Artigos [193]