An Algorithm for Influence Maximization in a Two-Terminal Series Parallel Graph and its Application to a Real Network

Discovery Science, pp. 275-283, 2015.

Cited by: 1|Views8


We developed an algorithm to exactly solve an influence maximization problem (MaxInf) for a two-terminal series parallel graph (TTSPG) in the independent cascade model. The class of TTSPGs can be considered as a class wider than that of trees, only for which an efficient exact solver of this problem has been developed so far. Our algorith...More



Get fulltext within 24h
Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.


Upload a single paper

for 5 coins

Wechat's Red Packet

Upload 50 articles

for 250 coins

Wechat's Red Packet

Upload 200 articles

for 1000 coins

Wechat's Red Packet

Upload 500 articles

for 2500 coins

Wechat's Red Packet

Upload 1000 articles

for 5000 coins

Wechat's Red Packet
Your rating :