Solving the k-dominating set problem on very large-scale networks

Nguyen, H Ha, H Nguyen, D

Permalink

Open Access

Copyright Clearance Process

This item is open access.

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Nguyen, H
dc.contributor.author	Ha, H
dc.contributor.author	Nguyen, D https://orcid.org/0000-0003-2659-8648
dc.date.accessioned	2020-08-07T01:26:52Z
dc.date.available	2020-08-07T01:26:52Z
dc.date.issued	2020-08-04
dc.identifier.citation	Computational Social Networks, 2020
dc.identifier.uri	http://hdl.handle.net/10453/142007
dc.language	en
dc.publisher	Springer
dc.relation.ispartof	Computational Social Networks
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	This is a post-peer-review, pre-copyedit version of an article published in Computational Social Networks. The final authenticated version is available online at: (DOI URI unavailable).	en_US
dc.title	Solving the k-dominating set problem on very large-scale networks
dc.type	Journal Article
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney
utslib.copyright.status	open_access	*
pubs.consider-herdc	true
dc.date.updated	2020-08-07T01:26:43Z
pubs.publication-status	Accepted

Please use this identifier to cite or link to this item: