C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Minimising K-Dominating Set in Arbitrary Network Graphs.
Guangyuan Wang
Hua Wang
Xiaohui Tao
Ji Zhang
Jinhua Zhang
Published in:
ADMA (2) (2013)
Keyphrases
</>
dominating set
connected dominating set
facility location problem
dynamic networks
small world
complex networks
peer to peer
computer networks
random graphs
fuzzy logic
fully connected
network architecture
communication networks
network structure
network design
spanning tree
weighted graph
wireless sensor networks