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...

Full description

Bibliographic Details

Published in:	Journal of parallel and distributed computing Vol. 198; p. 105037
Main Authors:	Barik, Reet, Cappa, Wade, Ferdous, S.M., Minutoli, Marco, Halappanavar, Mahantesh, Kalyanaraman, Ananth
Format:	Journal Article
Language:	English
Published:	United States Elsevier Inc 01.04.2025 Elsevier
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!