Some results on the target set selection problem

Chun Ying Chiang, Liang Hao Huang, Bo Jr Li, Jiaojiao Wu, Hong Gwa Yeh

研究成果: 雜誌貢獻期刊論文同行評審

54 引文 斯高帕斯(Scopus)

摘要

In this paper we consider a fundamental problem in the area of viral marketing, called Target Set Selection problem. We study the problem when the underlying graph is a block-cactus graph, a chordal graph or a Hamming graph. We show that if G is a block-cactus graph, then the Target Set Selection problem can be solved in linear time, which generalizes Chen's result (Discrete Math. 23:1400-1415, 2009) for trees, and the time complexity is much better than the algorithm in Ben-Zwi et al. (Discrete Optim., 2010) (for bounded treewidth graphs) when restricted to block-cactus graphs. We show that if the underlying graph G is a chordal graph with thresholds θ(v)≤2 for each vertex v in G, then the problem can be solved in linear time. For a Hamming graph G having thresholds θ(v)=2 for each vertex v of G, we precisely determine an optimal target set S for (G,θ). These results partially answer an open problem raised by Dreyer and Roberts (Discrete Appl. Math. 157:1615-1627, 2009).

原文???core.languages.en_GB???
頁(從 - 到)702-715
頁數14
期刊Journal of Combinatorial Optimization
25
發行號4
DOIs
出版狀態已出版 - 5月 2013

指紋

深入研究「Some results on the target set selection problem」主題。共同形成了獨特的指紋。

引用此