An inclusion hierarchy of irreversible dynamos
DOI10.1016/J.TCS.2015.06.035zbMATH Open1328.68145OpenAlexW1025665087MaRDI QIDQ2355698FDOQ2355698
Authors: W. Quattrociocchi, S. Brunetti, Elena Lodi 
Publication date: 24 July 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.06.035
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Distributed algorithms (68W15) Games involving graphs (91A43) Distributed systems (68M14)
Cites Work
- Local majorities, coalitions and monopolies in graphs: A review
- Bounding the number of tolerable faults in majority-based systems
- On the approximability of influence in social networks
- Combinatorial model and bounds for target set selection
- Fast Gossiping by Short Messages
- The power of small coalitions in graphs
- Small Alliances in Graphs
- Spreading messages
- Dynamic monopolies in tori.
- Dynamic monopolies of constant size
- Title not available (Why is that?)
- Listen to Your Neighbors: How (Not) to Reach a Consensus
- How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
- Minimum Weight Dynamo and Fast Opinion Spreading
Cited In (5)
This page was built for publication: An inclusion hierarchy of irreversible dynamos
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355698)
