Φορτώνει......
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...
Αποθηκεύτηκε σε:
| Τόπος έκδοσης: | Entropy (Basel) |
|---|---|
| Κύριοι συγγραφείς: | , , , |
| Μορφή: | Artigo |
| Γλώσσα: | Inglês |
| Έκδοση: |
MDPI
2019
|
| Θέματα: | |
| Διαθέσιμο Online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7514519/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.3390/e21121174 |
| Ετικέτες: |
Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|