Generalized threshold processes on graphs
DOI10.1016/J.TCS.2017.05.010zbMATH Open1372.68187OpenAlexW2618461208MaRDI QIDQ2402258FDOQ2402258
Authors: Dieter Rautenbach, Uéverton S. Souza, Carlos Vinícius G. C. Lima, Jayme L. Szwarcfiter 
Publication date: 7 September 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.05.010
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- A threshold of ln n for approximating set cover
- Title not available (Why is that?)
- Title not available (Why is that?)
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Onk-domination and minimum degree in graphs
- On the approximability of influence in social networks
- On dynamic monopolies of graphs with general thresholds
- Combinatorial model and bounds for target set selection
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Irreversible conversion of graphs
- On the approximability and exact algorithms for vector domination and related problems in graphs
- Random majority percolation
- An upper bound for thek-domination number of a graph
- Analytical approach to parallel repetition
- Metastability effects in bootstrap percolation
- Approximation hardness of dominating set problems in bounded degree graphs
- New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
- The power of small coalitions in graphs
- Remarks on dynamic monopolies with given average thresholds
- Spread of influence in weighted networks under time and budget constraints
- Irreversible conversion processes with deadlines
- On general frameworks and threshold functions for multiple domination
- Latency-bounded target set selection in social networks
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
Cited In (7)
- Title not available (Why is that?)
- Iterated open neighborhood graphs and generalizations
- A computational study of \(f\)-reversible processes on graphs
- On \(f\)-reversible processes on graphs
- Reversible iterative graph processes
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers
- Irreversible \(k\)-threshold conversion number of circulant graphs
This page was built for publication: Generalized threshold processes on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2402258)
