A simple fixpoint argument without the restriction to continuity
Acta Informatica
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Stabilization-Preserving Atomicity Refinement
Proceedings of the 13th International Symposium on Distributed Computing
A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Graph
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Linear time self-stabilizing colorings
Information Processing Letters
A Flexible Payment Scheme and Its Role-Based Access Control
IEEE Transactions on Knowledge and Data Engineering
Computers & Mathematics with Applications
Effective Collaboration with Information Sharing in Virtual Universities
IEEE Transactions on Knowledge and Data Engineering
Positive Influence Dominating Set in Online Social Networks
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Journal of Parallel and Distributed Computing
Self-stabilizing algorithms for {k}-domination
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
A new self-stabilizing maximal matching algorithm
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
On positive influence dominating sets in social networks
Theoretical Computer Science
Publishing anonymous survey rating data
Data Mining and Knowledge Discovery
Access control and authorization for protecting disseminative information in E-learning workflow
Concurrency and Computation: Practice & Experience
Satisfying Privacy Requirements Before Data Anonymization
The Computer Journal
| Hi-index | 0.00 |
Online social network has developed significantly in recent years. Most of current research has utilized the property of online social network to spread information and ideas. Motivated by applications in social networks (such as alcohol intervention strategies), a variation of the dominating set called a positive influence dominating set (PIDS) has been studied in the literature. However, the existing work all focused on greedy algorithms for the PIDS problem with different approximation ratios, which are limited to find approximate solutions to PIDS in large networks. In order to select a minimal PIDS (MPIDS) in large social networks, we first present a self-stabilizing algorithm for the MPIDS problem in this paper, which can find a MPIDS in an arbitrary network graph without any isolated node. It is assumed that the nodes in the proposed algorithm have globally unique identifiers, and the algorithm works under a central daemon. We further prove that the worst case convergence time of the algorithm from any arbitrary initial state is O(n2) steps where n is the number of nodes in the network.