An Influence Maximization Algorithm Based On The Mixed Importance Of Nodes
Source abstract
Abstract
The influence maximization is the problem of finding k seed nodes that maximize the scope of influence in a social network. Therefore, the comprehensive influence of node needs to be considered, when we choose the most influe... | Find, read and cite all the research you need on Tech Science Press
Source: openalex_inverted_index · Quality: baseline
Research context
OpenAlex topics: Text and Document Classification Technologies · Advanced Computing and Algorithms · Advanced Computational Techniques and Applications
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
References
Reference metadata was not supplied for this record.