Irreversible conversion processes with deadlines

DOI10.1016/j.jda.2013.12.002zbMath1298.05282OpenAlexW1966174252MaRDI QIDQ2447539

Vinícius Fernandes dos Santos, Dieter Rautenbach, Philipp Matthias Schäfer

Publication date: 28 April 2014

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2013.12.002

zbMATH Keywords

independencedominationdynamic monopolyiterative graph process

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Microeconomic theory (price theory and economic markets) (91B24) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Generalized threshold processes on graphs ⋮ On the complexity of reasoning about opinion diffusion under majority dynamics ⋮ Spread of influence in weighted networks under time and budget constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Irreversible conversion of graphs
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• Local majorities, coalitions and monopolies in graphs: A review
• The power of small coalitions in graphs
• On time versus size for monotone dynamic monopolies in regular topologies
• On periodical behaviour in societies with symmetric influences
• Random majority percolation
• Fault-Local Distributed Mending
• Listen to Your Neighbors: How (Not) to Reach a Consensus
• Optimal irreversible dynamos in chordal rings

This page was built for publication: Irreversible conversion processes with deadlines