Negin Bagherpour

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Maximum independent set problem is an NP-Hard one with the aim of finding the set of independent vertices with maximum possible cardinality in a graph. In this paper, we investigate a learning automaton based algorithm that finds a maximum independent set in the graph. Initially, a learning automaton is assigned to each vertex of graph. In order to find(More)
Due to great communication among users in social networks, a lot of attention is paid to the spreading of information. This issue is of a huge consideration in modern viral marketing either. So far, different models have been proposed in many of which active and inactive users are cooperating in the simple form. Since the influence of individuals in(More)
In recent years, with the rapid development of online social networks, an enormous amount of information has been generated and diffused by human interactions through online social networks. The availability of information diffused by users of online social networks has facilitated the investigation of information diffusion and influence maximization. In(More)
The need to estimate a positive definite solution to an overdetermined linear system of equations with multiple right hand side vectors arises in several process control contexts. The coefficient and the right hand side matrices are respectively named data and target matrices. A number of optimization methods were proposed for solving such problems, in(More)
  • 1