Pages that link to "Item:Q1603713"
From MaRDI portal
The following pages link to Local majorities, coalitions and monopolies in graphs: A review (Q1603713):
Displaying 50 items.
- Exact solutions for latency-bounded target set selection problem on some special families of graphs (Q260041) (← links)
- Global defensive sets in graphs (Q279197) (← links)
- More agents may decrease global work: a case in butterfly decontamination (Q343925) (← links)
- A study of monopolies in graphs (Q367095) (← links)
- On non-progressive spread of influence through social networks (Q401306) (← links)
- On dynamic monopolies of graphs with general thresholds (Q409449) (← links)
- Combinatorial model and bounds for target set selection (Q410735) (← links)
- Global defensive alliances of trees and Cartesian product of paths and cycles (Q412345) (← links)
- Treewidth governs the complexity of target set selection (Q456700) (← links)
- On the decycling number of generalized Kautz digraphs (Q477628) (← links)
- Graphs with few \(P_4\)'s under the convexity of paths of order three (Q491593) (← links)
- Triggering cascades on strongly connected directed graphs (Q500995) (← links)
- Irreversible conversion of graphs (Q551200) (← links)
- On dissemination thresholds in regular and irregular graph classes (Q627518) (← links)
- Spreading of messages in random graphs (Q633767) (← links)
- Dynamic monopolies with randomized starting configuration (Q653331) (← links)
- Reversible iterative graph processes (Q690472) (← links)
- On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) (← links)
- Optimal majority dynamics for the diffusion of an opinion when multiple alternatives are available (Q831148) (← links)
- Local event boundary detection with unreliable sensors: analysis of the majority vote scheme (Q897966) (← links)
- Network decontamination under \(m\)-immunity (Q908298) (← links)
- Near-optimal solutions for the generalized max-controlled set problem (Q976048) (← links)
- Global defensive alliances in star graphs (Q1026159) (← links)
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion (Q1028139) (← links)
- Spreading messages (Q1029342) (← links)
- On the \(P_3\)-hull number of some products of graphs (Q1634756) (← links)
- Bounding the open \(k\)-monopoly number of strong product graphs (Q1692650) (← links)
- On \(\alpha \)-domination in graphs (Q1706432) (← links)
- Alliances in graphs: parameters, properties and applications -- a survey (Q1713564) (← links)
- On the geodetic number of complementary prisms (Q1721934) (← links)
- A computational study of \(f\)-reversible processes on graphs (Q1752484) (← links)
- The effect of local majority on global majorityin connected graphs (Q1756113) (← links)
- On time versus size for monotone dynamic monopolies in regular topologies (Q1827282) (← 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 decycling number of outerplanar graphs (Q1956257) (← links)
- Some results on the target set selection problem (Q1956258) (← links)
- Phase transition of the 2-choices dynamics on core-periphery networks (Q1981807) (← links)
- The \(t\)-latency bounded strong target set selection problem in some kinds of special family of graphs (Q2025100) (← links)
- A note on the majority dynamics in inhomogeneous random graphs (Q2038874) (← links)
- Fixed points and 2-cycles of synchronous dynamic coloring processes on trees (Q2097353) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- The size of graphs with given feedback vertex number (Q2127624) (← links)
- On the computational complexity of the Helly number in the \(P_3\) and related convexities (Q2132356) (← links)
- Diffusion in large networks (Q2152343) (← links)
- On the harmless set problem parameterized by treewidth (Q2154099) (← links)
- Target set selection on generalized pancake graphs (Q2195642) (← links)
- Majority rule cellular automata (Q2232605) (← links)
- Parameterized approximability of maximizing the spread of influence in networks (Q2250539) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
