I have the following problem:
Consider an undirected weighted graph G where the weight of an edge between nodes a and b represents the probability of a message being passed from node a to node b (or from node b to node a).
Given G, I need to choose the n-th nodes that can spread a rumor to at least x other nodes and such that the probability of the rumor being passed to each of these other x nodes is at least p > 0.
Is there any algorithm that provides the list of nodes that meet these two conditions?
Thank you very much!!