Pages that link to "Item:Q1028139"

The following pages link to Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion (Q1028139):

Displayed 50 items.

• Complexity aspects of the triangle path convexity (Q277613) ‎ (← links)
• Complexity of determining the maximum infection time in the geodetic convexity (Q324866) ‎ (← links)
• Algorithmic and structural aspects of the \(P_3\)-Radon number (Q363552) ‎ (← links)
• A study of monopolies in graphs (Q367095) ‎ (← links)
• On dynamic monopolies of graphs with general thresholds (Q409449) ‎ (← links)
• Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids (Q427907) ‎ (← links)
• An upper bound on the \(P_3\)-Radon number (Q442343) ‎ (← links)
• On dynamic monopolies of graphs: the average and strict majority thresholds (Q448965) ‎ (← links)
• Upper bounds on the \(k\)-forcing number of a graph (Q479006) ‎ (← links)
• Triggering cascades on strongly connected directed graphs (Q500995) ‎ (← links)
• Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees (Q511918) ‎ (← links)
• Irreversible conversion of graphs (Q551200) ‎ (← links)
• Reversible iterative graph processes (Q690472) ‎ (← links)
• On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) ‎ (← links)
• The maximum infection time in the geodesic and monophonic convexities (Q897893) ‎ (← links)
• Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs (Q897965) ‎ (← links)
• The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degree (Q1627866) ‎ (← links)
• On the \(P_3\)-hull number of some products of graphs (Q1634756) ‎ (← links)
• Sharp thresholds for contagious sets in random graphs (Q1650097) ‎ (← links)
• Least cost influence propagation in (social) networks (Q1650779) ‎ (← links)
• The maximum time of 2-neighbor bootstrap percolation: complexity results (Q1686067) ‎ (← links)
• The P3 infection time is W[1]-hard parameterized by the treewidth (Q1705656) ‎ (← links)
• On \(\alpha \)-domination in graphs (Q1706432) ‎ (← links)
• Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results (Q1711228) ‎ (← links)
• On the geodetic number of complementary prisms (Q1721934) ‎ (← links)
• Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach (Q1727735) ‎ (← links)
• Zero forcing in iterated line digraphs (Q1727740) ‎ (← links)
• The zero forcing polynomial of a graph (Q1732095) ‎ (← links)
• Dynamic monopolies for interval graphs with bounded thresholds (Q1741518) ‎ (← links)
• A computational study of \(f\)-reversible processes on graphs (Q1752484) ‎ (← links)
• Triggering cascades on undirected connected graphs (Q1944178) ‎ (← links)
• On reversible cascades in scale-free and Erdős-Rényi random graphs (Q1946489) ‎ (← links)
• The firefighter problem with more than one firefighter on trees (Q1949095) ‎ (← links)
• Some results on the target set selection problem (Q1956258) ‎ (← links)
• On some tractable and hard instances for partial incentives and target set selection (Q2010927) ‎ (← links)
• Complexity and computation of connected zero forcing (Q2012050) ‎ (← links)
• Large-scale influence maximization via maximal covering location (Q2028806) ‎ (← links)
• On reconfigurability of target sets (Q2110378) ‎ (← links)
• Max-linear models in random environment (Q2140875) ‎ (← links)
• Diffusion in large networks (Q2152343) ‎ (← links)
• On the harmless set problem parameterized by treewidth (Q2154099) ‎ (← links)
• Harmless sets in sparse classes (Q2169963) ‎ (← links)
• Target set selection on generalized pancake graphs (Q2195642) ‎ (← links)
• Computing the hull number in \(\Delta \)-convexity (Q2205950) ‎ (← links)
• Target set selection for conservative populations (Q2235265) ‎ (← links)
• Parameterized approximability of maximizing the spread of influence in networks (Q2250539) ‎ (← links)
• Constant thresholds can make target set selection tractable (Q2254488) ‎ (← links)
• Vector domination in split-indifference graphs (Q2281167) ‎ (← links)
• Whom to befriend to influence people (Q2292915) ‎ (← links)
• Partial immunization of trees (Q2299985) ‎ (← links)