Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Gautam, Rahul Kumar"'
The information flows among the people while they communicate through social media websites. Due to the dependency on digital media, a person shares important information or regular updates with friends and family. The set of persons on social media
Externí odkaz:
http://arxiv.org/abs/2406.08876
Nowadays, organizations use viral marketing strategies to promote their products through social networks. It is expensive to directly send the product promotional information to all the users in the network. In this context, Kempe et al. \cite{kempe2
Externí odkaz:
http://arxiv.org/abs/2404.08236
Given a graph $G=(V, E)$, the problem of Graph Burning is to find a sequence of nodes from $V$, called a burning sequence, to burn the whole graph. This is a discrete-step process, and at each step, an unburned vertex is selected as an agent to sprea
Externí odkaz:
http://arxiv.org/abs/2307.08505
Given a graph $G=(V,E)$, the problem of \gb{} is to find a sequence of nodes from $V$, called burning sequence, in order to burn the whole graph. This is a discrete-step process, in each step an unburned vertex is selected as an agent to spread fire
Externí odkaz:
http://arxiv.org/abs/2204.00772
Graph burning is a process of information spreading through the network by an agent in discrete steps. The problem is to find an optimal sequence of nodes which have to be given information so that the network is covered in least number of steps. Gra
Externí odkaz:
http://arxiv.org/abs/2008.08811
Publikováno v:
Discrete Mathematics, Algorithms & Applications; Oct2024, Vol. 16 Issue 7, p1-20, 20p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Applied Intelligence; Jan2022, Vol. 52 Issue 2, p1351-1361, 11p