Pages that link to "Item:Q448965"
From MaRDI portal
The following pages link to On dynamic monopolies of graphs: the average and strict majority thresholds (Q448965):
Displayed 14 items.
- Exact solutions for latency-bounded target set selection problem on some special families of graphs (Q260041) (← links)
- On dynamic monopolies of graphs with general thresholds (Q409449) (← 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)
- On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) (← links)
- Integer programming approach to static monopolies in graphs (Q1752610) (← links)
- The \(t\)-latency bounded strong target set selection problem in some kinds of special family of graphs (Q2025100) (← links)
- Facets of the dynamic monopoly polytope: linear ordering formulation (Q2042076) (← links)
- Remarks on dynamic monopolies with given average thresholds (Q2259575) (← links)
- A polyhedral study of dynamic monopolies (Q2288851) (← links)
- Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs (Q2444564) (← links)
- Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks (Q2449109) (← links)
- ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC THRESHOLDS (Q2933686) (← links)
- On irreversible spread of influence in edge-weighted graphs (Q3303530) (← links)