The following pages link to Irreversible conversion of graphs (Q551200):
Displayed 50 items.
- Complexity aspects of the triangle path convexity (Q277613) (← links)
- Algorithmic and structural aspects of the \(P_3\)-Radon number (Q363552) (← links)
- On the Carathéodory number of interval and graph convexities (Q392186) (← links)
- An upper bound on the \(P_3\)-Radon number (Q442343) (← links)
- Graphs with few \(P_4\)'s under the convexity of paths of order three (Q491593) (← links)
- Inapproximability results for graph convexity parameters (Q496002) (← links)
- On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs (Q510982) (← links)
- Complexity properties of complementary prisms (Q511681) (← links)
- Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees (Q511918) (← links)
- Reversible iterative graph processes (Q690472) (← links)
- Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs (Q897965) (← links)
- On the \(P_3\)-hull number of some products of graphs (Q1634756) (← links)
- Discovering small target sets in social networks: a fast and effective algorithm (Q1635708) (← links)
- The maximum time of 2-neighbor bootstrap percolation: complexity results (Q1686067) (← links)
- The convexity of induced paths of order three and applications: complexity aspects (Q1701089) (← links)
- Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach (Q1727735) (← links)
- Active influence spreading in social networks (Q1731507) (← links)
- Dynamic monopolies for interval graphs with bounded thresholds (Q1741518) (← links)
- A computational study of \(f\)-reversible processes on graphs (Q1752484) (← links)
- Characterization and recognition of Radon-independent sets in split graphs (Q1941699) (← links)
- On some tractable and hard instances for partial incentives and target set selection (Q2010927) (← links)
- The hull number in the convexity of induced paths of order \(3\) (Q2077392) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- \(P_3\)-hull number of graphs with diameter two (Q2132359) (← links)
- On the harmless set problem parameterized by treewidth (Q2154099) (← links)
- A general framework for path convexities (Q2156285) (← links)
- Computing the hull number in toll convexity (Q2159554) (← links)
- On the \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products (Q2161271) (← links)
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers (Q2172420) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- Vector domination in split-indifference graphs (Q2281167) (← links)
- On the Carathéodory and exchange numbers of geodetic convexity in graphs (Q2283030) (← links)
- Whom to befriend to influence people (Q2292915) (← links)
- Fast and frugal targeting with incentives (Q2297851) (← links)
- Partial immunization of trees (Q2299985) (← links)
- The complexity of finding harmless individuals in social networks (Q2339843) (← links)
- Influence diffusion in social networks under time window constraints (Q2345457) (← links)
- The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects (Q2346581) (← links)
- Spread of influence in weighted networks under time and budget constraints (Q2347001) (← links)
- Generalized threshold processes on graphs (Q2402258) (← links)
- Irreversible conversion processes with deadlines (Q2447539) (← links)
- Latency-bounded target set selection in social networks (Q2447759) (← links)
- Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks (Q2449109) (← links)
- The Carathéodory number of the \(P_3\) convexity of chordal graphs (Q2449132) (← links)
- Vaccinate your trees! (Q2632015) (← links)
- Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems (Q2669540) (← links)
- Irreversible \(k\)-threshold conversion number of circulant graphs (Q2676193) (← links)
- Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482) (← links)
- Evangelism in Social Networks (Q2819494) (← links)
- Influence Diffusion in Social Networks under Time Window Constraints (Q2868640) (← links)