Bounding the number of tolerable faults in majority-based systems
From MaRDI portal
(Redirected from Publication:3562996)
Recommendations
Cited in
(13)- On time versus size for monotone dynamic monopolies in regular topologies
- Triggering cascades on undirected connected graphs
- On reversible cascades in scale-free and Erdős-Rényi random graphs
- The t-latency bounded strong target set selection problem in some kinds of special family of graphs
- An inclusion hierarchy of irreversible dynamos
- Dynamic monopolies and feedback vertex sets in hexagonal grids
- Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks
- Exact solutions for latency-bounded target set selection problem on some special families of graphs
- Combinatorial model and bounds for target set selection
- Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids
- Triggering cascades on strongly connected directed graphs
- Dynamic monopolies with randomized starting configuration
- Minimal contagious sets: degree distributional bounds
This page was built for publication: Bounding the number of tolerable faults in majority-based systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562996)
