Cargando…
New Computation of Resolving Connected Dominating Sets in Weighted Networks
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 co...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
MDPI
2019
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7514519/ http://dx.doi.org/10.3390/e21121174 |