Minimising K-Dominating Set in Arbitrary Network Graphs

Full text for this resource is not available from the Research Repository.

Wang, G, Wang, Hua ORCID: 0000-0002-8465-0996, Tao, X, Zhang, J and Zhang, J (2013) Minimising K-Dominating Set in Arbitrary Network Graphs. In: Advanced Data Mining and Applications, 14 December 2013-16 December 2013, Hangzhou, China.

Abstract

Series title: Lecture notes in computer science, v8347

Item type Conference or Workshop Item (Paper)
URI http://vuir.vu.edu.au/id/eprint/27587
Identification Number https://doi.org/10.1007/978-3-642-53917-6_11
ISBN 9783642539176
Subjects Current > FOR Classification > 0806 Information Systems
Historical > Faculty/School/Research Centre/Department > Centre for Applied Informatics
Keywords self-stabilizing algorithm; distributed deamon model; minimal k-dominating set; arbitrary network; convergence
Citations in Scopus 1 - View on Scopus
Download/View statistics View download statistics for this item

Search Google Scholar

Repository staff login