An inclusion hierarchy of irreversible dynamos

DOI10.1016/j.tcs.2015.06.035zbMath1328.68145OpenAlexW1025665087MaRDI QIDQ2355698

W. Quattrociocchi, Sara 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

zbMATH Keywords

distributed algorithmstarget set selectionirreversible dynamic monopolies

Mathematics Subject Classification ID

Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (1)

Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees

Cites Work

• Unnamed Item
• Combinatorial model and bounds for target set selection
• Spreading messages
• Dynamic monopolies in tori.
• Local majorities, coalitions and monopolies in graphs: A review
• The power of small coalitions in graphs
• Dynamic monopolies of constant size
• How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
• Small Alliances in Graphs
• Bounding the Number of Tolerable Faults in Majority-Based Systems
• On the Approximability of Influence in Social Networks
• Fast Gossiping by Short Messages
• Listen to Your Neighbors: How (Not) to Reach a Consensus
• Minimum Weight Dynamo and Fast Opinion Spreading

This page was built for publication: An inclusion hierarchy of irreversible dynamos