Caricamento...
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...
Salvato in:
| Pubblicato in: | Entropy (Basel) |
|---|---|
| Autori principali: | , , , |
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
MDPI
2019
|
| Soggetti: | |
| Accesso online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7514519/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.3390/e21121174 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|