Irreversible conversion processes with deadlines

DOI10.1016/J.JDA.2013.12.002MaRDI QIDQ2447539zbMATH OpenOpenAlexFDO

Authors Dieter Rautenbach, Vinícius F. dos Santos, Philipp M. 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

dominationdynamic monopolyindependenceiterative graph process

Mathematics Subject Classification ID

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

Recommendations

• Irreversibility time scale
• scientific article; zbMATH DE number 3241251
• On irreversible microscopic processes
• REVERSIBLE AND NON-DISSIPATIVE PROCESSES
• Irreversibility revisited
• Irreversible conversion of graphs
• scientific article; zbMATH DE number 4179883
• Irreversibility in reversible systems
• Miscellanea. On time-reversibility of linear processes

Cites work

• Fault-Local Distributed Mending
• scientific article; zbMATH DE number 2186652 (Why is no real title available?)
• scientific article; zbMATH DE number 4206005 (Why is no real title available?)
• scientific article; zbMATH DE number 3914370 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• Irreversible conversion of graphs
• Listen to Your Neighbors: How (Not) to Reach a Consensus
• Local majorities, coalitions and monopolies in graphs: A review
• On periodical behaviour in societies with symmetric influences
• On time versus size for monotone dynamic monopolies in regular topologies
• Optimal irreversible dynamos in chordal rings
• Random majority percolation
• The power of small coalitions in graphs
• The probabilistic method. With an appendix on the life and work of Paul Erdős.

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2447539)