Skip navigation
  •  Home
  • UDC 
    • Getting started
    • RUC Policies
    • FAQ
    • FAQ on Copyright
    • More information at INFOguias UDC
  • Browse 
    • Communities
    • Browse by:
    • Issue Date
    • Author
    • Title
    • Subject
  • Help
    • español
    • Gallegan
    • English
  • Login
  •  English 
    • Español
    • Galego
    • English
  
View Item 
  •   DSpace Home
  • 1. Investigación
  • Grupos de investigación
  • Grupo de Tecnoloxía Electrónica e Comunicacións (GTEC)
  • GI-GTEC - Artigos
  • View Item
  •   DSpace Home
  • 1. Investigación
  • Grupos de investigación
  • Grupo de Tecnoloxía Electrónica e Comunicacións (GTEC)
  • GI-GTEC - Artigos
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Calculation of the Connected Dominating Set Considering Vertex Importance Metrics

Thumbnail
View/Open
Vázquez-Araujo_Francisco_2018_Calculation_of_the_Connected_Dominating_Set_Considering.pdf (1.326Mb)
Use this link to cite
http://hdl.handle.net/2183/20754
Atribución 3.0 España
Except where otherwise noted, this item's license is described as Atribución 3.0 España
Collections
  • GI-GTEC - Artigos [113]
Metadata
Show full item record
Title
Calculation of the Connected Dominating Set Considering Vertex Importance Metrics
Author(s)
Vázquez Araújo, Francisco Javier
Dapena, Adriana
Souto Salorio, María José
Castro-Castro, Paula-María
Date
2018-01-28
Citation
Vazquez-Araujo, F.; Dapena, A.; Souto-Salorio, M.J.; Castro, P.M. Calculation of the Connected Dominating Set Considering Vertex Importance Metrics. Entropy 2018, 20, 87.
Abstract
[Abstract] The computation of a set constituted by few vertices to define a virtual backbone supporting information interchange is a problem that arises in many areas when analysing networks of different natures, like wireless, brain, or social networks. Recent papers propose obtaining such a set of vertices by computing the connected dominating set (CDS) of a graph. In recent works, the CDS has been obtained by considering that all vertices exhibit similar characteristics. However, that assumption is not valid for complex networks in which their vertices can play different roles. Therefore, we propose finding the CDS by taking into account several metrics which measure the importance of each network vertex e.g., error probability, entropy, or entropy variation (EV).
Keywords
Connected dominating set
Complex networks
Graph entropy
Vertex importance
 
Editor version
https://doi.org/10.3390/e20020087
Rights
Atribución 3.0 España
ISSN
1099-4300

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Statistics

View Usage Statistics
Sherpa
OpenArchives
OAIster
Scholar Google
UNIVERSIDADE DA CORUÑA. Servizo de Biblioteca.    DSpace Software Copyright © 2002-2013 Duraspace - Send Feedback