The Open UniversitySkip to content

Total positive influence domination on weighted networks

Vukadinovic Greetham, Danica; Nathaniel, Charlton and Anush, Poghosyan (2019). Total positive influence domination on weighted networks. In: The 8th International Conference on Complex Networks and their Applications, 10-12 Dec 2019, Lisbon.

Google Scholar: Look up in Google Scholar


We are proposing two greedy and a new linear programming based approximation algorithm for the total positive influence dominat- ing set problem in weighted networks. Applications of this problem in weighted settings include finding: a minimum cost set of nodes to broad- cast a message in social networks, such that each node has majority of neighbours broadcasting that message; a maximum trusted set in bitcoin network; an optimal set of hosts when running distributed apps etc. Ex- tensive experiments on different generated and real networks highlight advantages and potential issues for each algorithm.

Item Type: Conference or Workshop Item
Copyright Holders: Danica Vukadinovic Greetham, Springer
Keywords: domination sets, total positive influence, vertex-weighted networks, network communities
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Knowledge Media Institute (KMi)
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Item ID: 67223
Depositing User: Danica Vukadinovic Greetham
Date Deposited: 10 Oct 2019 10:02
Last Modified: 10 Oct 2019 20:41
Share this page:

Actions (login may be required)

Policies | Disclaimer

© The Open University   contact the OU