載入...
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...
Na minha lista:
| 發表在: | Entropy (Basel) |
|---|---|
| Main Authors: | , , , |
| 格式: | Artigo |
| 語言: | Inglês |
| 出版: |
MDPI
2019
|
| 主題: | |
| 在線閱讀: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7514519/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.3390/e21121174 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|