Local majorities, coalitions and monopolies in graphs: a review
Theoretical Computer Science
Max- and Min-Neighborhood Monopolies
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Majority Consensus and the Local Majority Rule
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Feedback vertex sets in mesh-based networks
Theoretical Computer Science
On the approximability of influence in social networks
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics
Theoretical Computer Science
An exact almost optimal algorithm for target set selection in social networks
Proceedings of the 10th ACM conference on Electronic commerce
Near-optimal solutions for the generalized max-controlled set problem
Computers and Operations Research
Probabilistic local majority voting for the agreement problem on finite graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Note: Combinatorial model and bounds for target set selection
Theoretical Computer Science
Brief announcement: on reversible and irreversible conversions
DISC'10 Proceedings of the 24th international conference on Distributed computing
Irreversible conversion of graphs
Theoretical Computer Science
Dynamic monopolies and feedback vertex sets in hexagonal grids
Computers & Mathematics with Applications
Variants of spreading messages
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Stable sets of threshold-based cascades on the erdős-rényi random graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Discrete Applied Mathematics
Triggering cascades on undirected connected graphs
Information Processing Letters
Treewidth governs the complexity of target set selection
Discrete Optimization
Reversible iterative graph processes
Theoretical Computer Science
Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades
Theoretical Computer Science
Minimum weight dynamo and fast opinion spreading
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
A New Model for Probabilistic Polling on Social Network
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
| Hi-index | 0.05 |