Method Maximizing the Spread of Influence in Directed Signed Weighted Graphs
We propose a new method for maximizing the spread of influence, based on the identification of significant factors of the total energy of a control system. The model of a socio-economic system can be represented in the form of cognitive maps that are directed signed weighted graphs with cause-and-ef...
Main Authors: | Alexander Nikolaevich Tselykh, Vladislav Sergeevich Vasilev, Larisa Anatolievna Tselykh, Simon Antonovich Barkovskii |
---|---|
Format: | Article |
Language: | English |
Published: |
VSB-Technical University of Ostrava
2017-01-01
|
Series: | Advances in Electrical and Electronic Engineering |
Subjects: | |
Online Access: | http://advances.utc.sk/index.php/AEEE/article/view/1950 |
Similar Items
-
Graph Mining for Influence Maximization in Social Networks
by: Rossi, Maria
Published: (2017) -
An Influence maximization algorithm in social network using K-shell decomposition and community detection
by: Alighanbari, et al.
Published: (2020-03-01) -
A note on co-maximal graphs of commutative rings
by: Deepa Sinha, et al.
Published: (2018-04-01) -
Influence maximization algorithm: Review on current approaches and limitations
by: Kristo Radion Purba, et al.
Published: (2021-03-01) -
Scalable analytics of massive graphs
by: Popova, Diana
Published: (2018)