GreediRIS: Scalable influence maximization using distributed streaming maximum cover

Influence maximization—the problem of identifying a subset of k influential seeds (vertices) in a network—is a classical problem in network science with numerous applications. The problem is NP-hard, but there exist efficient polynomial time approximations. However, scaling these algorithms still re...

Celý popis

Podrobná bibliografie

Vydáno v:	Journal of parallel and distributed computing Ročník 198; s. 105037
Hlavní autoři:	Barik, Reet, Cappa, Wade, Ferdous, S.M., Minutoli, Marco, Halappanavar, Mahantesh, Kalyanaraman, Ananth
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	United States Elsevier Inc 01.04.2025 Elsevier
Témata:	Distributed influence maximization Distributed submodular maximization Parallel graph algorithms Streaming maximum k-cover Distributed submodular maximization Streaming maximum k-cover Distributed influence maximization Parallel graph algorithms
ISSN:	0743-7315
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!