3 papers
cs.SI2025
ELRUHNA: Elimination Rule-basedHypergraph Alignment
Cameron Ibrahim, S M Ferdous, Ilya Safro +2
Hypergraph alignment is a well-known NP-hard problem with numerous practical applications across domains such as bioinformatics, social network analysis, and computer vision. Despi…
cs.SI2025
GNN-Based Candidate Node Predictor for Influence Maximization in Temporal Graphs
Priyanka Gautam, Balasubramaniam Natarajan, Sai Munikoti +2
In an age where information spreads rapidly across social media, effectively identifying influential nodes in dynamic networks is critical. Traditional influence maximization strat…
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…