Irreversible <mml:math altimg="si38.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>k</mml:mi></mml:math>-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion-Reference-Cited by-同舟云学术

Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion

Published:2009-04 Issue:7 Volume:157 Page:1615-1627
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Dreyer Paul A.,Roberts Fred S.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference24 articles.

1. E. Berger, Dynamic monopolies of constant size, Technical Report, Los Alamos National Laboratories, 1999. Available at http://xxx.lanl.gov/abs/math/9911125

2. E. Berger, Personal communications via e-mail, May 1999

3. Reaching a consensus;Degroot;Journal of the American Statistical Association,1974

4. P.A. Dreyer, Applications and variations of domination in graphs. Ph.D. Thesis, Rutgers University, 2000

5. P. Flocchini, E. Lodi, F. Luccio, L. Pagli, N. Santoro, Irreversible dynamos in tori, in: Proceedings of EUROPAR, 1998, pp. 554–562

Cited by 148 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs;Journal of Combinatorial Optimization;2024-04-25

2. On Structural Parameterizations of the Harmless Set Problem;Algorithmica;2024-01-09

3. Hierarchical Cycle-Tree Packing Model for Optimal K-Core Attack;Journal of Statistical Physics;2023-12-12

4. A Greedy Heuristic for Majority Target Set Selection in Social Networks;Proceedings of the International Conference on Advances in Social Networks Analysis and Mining;2023-11-06

5. Target set selection with maximum activation time;Discrete Applied Mathematics;2023-10