Graph-based analysis of influence spread
The influence maximization is a well-known problem in network science. This problem is to target k nodes as seeds in a network G and maximize the spread of influence in this network. Lots of models have been created for this problem and to find relatively good results is easy. From the neighborhood...
Elmentve itt :
| Szerző: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Könyv része |
| Megjelent: |
2018
|
| Sorozat: | Conference of PhD Students in Computer Science
11 |
| Kulcsszavak: | Számítástechnika, Számítógép-hálózat - Internet, Gráf |
| Online Access: | http://acta.bibl.u-szeged.hu/61794 |
| Tartalmi kivonat: | The influence maximization is a well-known problem in network science. This problem is to target k nodes as seeds in a network G and maximize the spread of influence in this network. Lots of models have been created for this problem and to find relatively good results is easy. From the neighborhood of graph’s nodes we can define local optima in the influence maximization. We aim to find connections between the structure of graph and the local optima for classifying the problem’s difficulty for a given input graphs or to find properties that make easier the searching of nearly global optimal results in huge networks. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 167-168 |