Minimising K-Dominating Set in Arbitrary Network Graphs

Guangyuan Wang, Hua Wang, Xiaohui Tao, Ji Zhang, Jinhua Zhang. Minimising K-Dominating Set in Arbitrary Network Graphs. In Hiroshi Motoda, Zhaohui Wu, Longbing Cao, Osmar R. Zaïane, Min Yao, Wei Wang 0009, editors, Advanced Data Mining and Applications - 9th International Conference, ADMA 2013, Hangzhou, China, December 14-16, 2013, Proceedings, Part II. Volume 8347 of Lecture Notes in Computer Science, pages 120-132, Springer, 2013. [doi]

@inproceedings{WangWTZZ13,
  title = {Minimising K-Dominating Set in Arbitrary Network Graphs},
  author = {Guangyuan Wang and Hua Wang and Xiaohui Tao and Ji Zhang and Jinhua Zhang},
  year = {2013},
  doi = {10.1007/978-3-642-53917-6_11},
  url = {http://dx.doi.org/10.1007/978-3-642-53917-6_11},
  researchr = {https://researchr.org/publication/WangWTZZ13},
  cites = {0},
  citedby = {0},
  pages = {120-132},
  booktitle = {Advanced Data Mining and Applications - 9th International Conference, ADMA 2013, Hangzhou, China, December 14-16, 2013, Proceedings, Part II},
  editor = {Hiroshi Motoda and Zhaohui Wu and Longbing Cao and Osmar R. Zaïane and Min Yao and Wei Wang 0009},
  volume = {8347},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-53916-9},
}