Research Repository

Minimising K-Dominating Set in Arbitrary Network Graphs

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.

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

Abstract

Series title: Lecture notes in computer science, v8347

Item Type: Conference or Workshop Item (Paper)
ISBN: 9783642539176
Uncontrolled Keywords: self-stabilizing algorithm; distributed deamon model; minimal k-dominating set; arbitrary network; convergence
Subjects: FOR Classification > 0806 Information Systems
Faculty/School/Research Centre/Department > Centre for Applied Informatics
Depositing User: Symplectic Elements
Date Deposited: 24 Jun 2015 22:47
Last Modified: 21 Jun 2018 05:32
URI: http://vuir.vu.edu.au/id/eprint/27587
DOI: https://doi.org/10.1007/978-3-642-53917-6_11
ePrint Statistics: View download statistics for this item
Citations in Scopus: 1 - View on Scopus

Repository staff only

View Item View Item

Search Google Scholar