Reversible iterative graph processes
DOI10.1016/J.TCS.2012.05.042zbMATH Open1254.05171OpenAlexW2080570447MaRDI QIDQ690472FDOQ690472
Authors: Mitre C. Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme L. Szwarcfiter 
Publication date: 27 November 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.042
Recommendations
consensusdynamic monopolyfinite discrete dynamical systemslocal majority processconquest and expansion gamesiterative polling processlocal interaction gamesreachability problems
Cites Work
- Local majorities, coalitions and monopolies in graphs: A review
- On time versus size for monotone dynamic monopolies in regular topologies
- On periodical behaviour in societies with symmetric influences
- On the approximability of influence in social networks
- Title not available (Why is that?)
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Irreversible conversion of graphs
- Two-Processor Scheduling with Start-Times and Deadlines
- Random majority percolation
- Fault-Local Distributed Mending
- Size bounds for dynamic monopolies
- An improved testing scheme for catastrophic fault patterns
- Convergence to equilibrium in local interaction games
- Contagion
- The power of small coalitions in graphs
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
- Comportement périodique des fonctions à seuil binaires et applications
- Dynamic monopolies of constant size
- Optimal irreversible dynamos in chordal rings
- Listen to Your Neighbors: How (Not) to Reach a Consensus
- Distributed probabilistic polling and applications to proportionate agreement
- A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem
- Complexity of reachability problems for finite discrete dynamical systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- On pre-periods of discrete influence systems
- On the Period-Two-Property of the Majority Operator in Infinite Graphs
- Title not available (Why is that?)
- Characterization of catastrophic faults in two-dimensional reconfigurable systolic arrays with unidirectional links
- On an application of convexity to discrete systems
Cited In (6)
- Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree
- Irreversible conversion of graphs
- A computational study of \(f\)-reversible processes on graphs
- On \(f\)-reversible processes on graphs
- The interchange process with reversals on the complete graph
- The predecessor-existence problem for \(k\)-reversible processes
This page was built for publication: Reversible iterative graph processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690472)
