Graph-based analysis of influence spread

Homolya, Viktor: Graph-based analysis of influence spread. Conference of PhD Students in Computer Science, (11). pp. 167-168. (2018)

[img] Cikk, tanulmány, mű
cscs_2018_180-181.pdf

Download (129kB)

Abstract

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.

Item Type: Article
Event Title: Conference of PhD students in computer science (11.) (2018) (Szeged)
Journal or Publication Title: Conference of PhD Students in Computer Science
Date: 2018
Volume: 11
Page Range: pp. 167-168
Uncontrolled Keywords: Számítástechnika, Számítógép-hálózat - Internet, Gráf
Additional Information: Bibliogr.: 168. p. ; összefoglalás angol nyelven
Date Deposited: 2019. Nov. 04. 14:38
Last Modified: 2019. Nov. 04. 14:38
URI: http://acta.bibl.u-szeged.hu/id/eprint/61794

Actions (login required)

View Item View Item