Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids
From MaRDI portal
(Redirected from Publication:427907)
Recommendations
Cites work
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 1754618 (Why is no real title available?)
- Bounding the number of tolerable faults in majority-based systems
- Combinatorial model and bounds for target set selection
- Dynamic monopolies and feedback vertex sets in hexagonal grids
- Dynamic monopolies in tori.
- Dynamic monopolies of constant size
- Irreversible \(k\)-threshold and majority conversion processes on complete multipartite graphs and graph products
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Listen to Your Neighbors: How (Not) to Reach a Consensus
- On dynamic monopolies of graphs with general thresholds
- Optimal irreversible dynamos in chordal rings
- Size bounds for dynamic monopolies
Cited in
(10)- Dynamic monopolies in two-way bootstrap percolation
- On dynamic monopolies of graphs with probabilistic thresholds
- Constant thresholds can make target set selection tractable
- Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks
- Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results
- Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
- Dynamic monopolies and feedback vertex sets in hexagonal grids
- About a mathematical model of faults in contact networks
- Triggering cascades on strongly connected directed graphs
- Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees
This page was built for publication: Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427907)