ListarGrupo de Tecnoloxía Electrónica e Comunicacións (GTEC) por tema "Graph entropy"
Mostrando ítems 1-2 de 2
-
Calculation of the Connected Dominating Set Considering Vertex Importance Metrics
(M D P I AG, 2018-01-28)[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 ... -
New Computation of Resolving Connected Dominating Sets in Weighted Networks
(M D P I AG, 2019-11-29)[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 ...