3 papers
cs.DC2024
GreediRIS: Scalable Influence Maximization using Distributed Streaming Maximum Cover
Reet Barik, Wade Cappa, S M Ferdous +3
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. Th…
cs.DC2024
Picasso: Memory-Efficient Graph Coloring Using Palettes With Applications in Quantum Computing
S M Ferdous, Reece Neff, Bo Peng +6
A coloring of a graph is an assignment of colors to vertices such that no two neighboring vertices have the same color. The need for memory-efficient coloring algorithms is motivat…
cs.DC2022
HBMax: Optimizing Memory Efficiency for Parallel Influence Maximization on Multicore Architectures
Xinyu Chen, Marco Minutoli, Jiannan Tian +3
Influence maximization aims to select k most-influential vertices or seeds in a network, where influence is defined by a given diffusion process. Although computing optimal seed se…