Old Web
English
Sign In
Acemap
>
Paper
>
An Efficient Algorithm for the k-Dominating Set Problem on Very Large-Scale Networks
An Efficient Algorithm for the k-Dominating Set Problem on Very Large-Scale Networks
2019
Mh Nguyen
MH Ha
Diep N. Nguyen
H. Dinh
Eryk Dutkiewicz
Tt Tran
Keywords:
Dominating set
Computer science
Algorithm
efficient algorithm
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]