Target Set Selection Problem for Honeycomb Networks

DOI10.1137/120868864zbMath1272.68063arXiv1203.0666OpenAlexW2964099023MaRDI QIDQ5300497

Liang-Hao Huang, Chun-Ying Chiang, Hong-Gwa Yeh

Publication date: 27 June 2013

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.0666

zbMATH Keywords

social networksfeedback vertex settarget set selectionviral marketinghoneycomb networkhexagonal griddynamic monopoliesirreversible spread of influencedecyclingstrict majority treshold

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Combinatorial optimization (90C27) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (13)

Discovering small target sets in social networks: a fast and effective algorithm ⋮ Optimizing Spread of Influence in Social Networks via Partial Incentives ⋮ A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks ⋮ Target set selection on generalized pancake graphs ⋮ Latency-bounded target set selection in social networks ⋮ Active influence spreading in social networks ⋮ The \(t\)-latency bounded strong target set selection problem in some kinds of special family of graphs ⋮ Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis ⋮ Whom to befriend to influence people ⋮ Influence diffusion in social networks under time window constraints ⋮ Spread of influence in weighted networks under time and budget constraints ⋮ Influence Diffusion in Social Networks under Time Window Constraints ⋮ Exact solutions for latency-bounded target set selection problem on some special families of graphs

This page was built for publication: Target Set Selection Problem for Honeycomb Networks