Pages that link to "Item:Q2150397"

The following pages link to An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks (Q2150397):

Displaying 7 items.

• A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks (Q2168709) (← links)
• Extreme value distributions for two kinds of path sums of Markov chain (Q2176396) (← links)
• The connected critical node problem (Q2672625) (← links)
• Influence Maximization with Latency Requirements on Social Networks (Q5085986) (← links)
• Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem (Q5087709) (← links)
• A unified greedy approximation for several dominating set problems (Q6093579) (← links)
• An efficient local search algorithm for minimum positive influence dominating set problem (Q6109569) (← links)