Pages that link to "Item:Q3305478"
From MaRDI portal
The following pages link to Minimizing the Spread of Rumor Within Budget Constraint in Online Network (Q3305478):
Displaying 11 items.
- Blocking rumor by cut (Q721923) (← links)
- Maximizing misinformation restriction within time and budget constraints (Q1752625) (← links)
- Containment of rumor spread by selecting immune nodes in social networks (Q1981274) (← links)
- Rumor correction maximization problem in social networks (Q1998850) (← links)
- Cost-effective anti-rumor message-pushing schemes (Q2067120) (← links)
- Minimum budget for misinformation detection in online social networks with provable guarantees (Q2115311) (← links)
- Community-based rumor blocking maximization in social networks: algorithms and analysis (Q2202013) (← links)
- Minimum budget for misinformation blocking in online social networks (Q2279752) (← links)
- General rumor blocking: an efficient random algorithm with martingale approach (Q2283009) (← links)
- Centralized and decentralized rumor blocking problems (Q2410051) (← links)
- Controlling Spread of Rumor Using Neighbor Centrality (Q5360175) (← links)