5 papers · 1 filter
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…
AGS-GNN: Attribute-guided Sampling for Graph Neural Networks
Siddhartha Shankar Das, S M Ferdous, Mahantesh M Halappanavar +2
We propose AGS-GNN, a novel attribute-guided sampling algorithm for Graph Neural Networks (GNNs) that exploits node features and connectivity structure of a graph while simultaneou…
Approximate Bipartite -Matching using Multiplicative Auction
Bhargav Samineni, S M Ferdous, Mahantesh Halappanavar +1
Given a bipartite graph with vertices and edges and a function , a -matching is a subset of edges such that every verte…
GreedyML: A Parallel Algorithm for Maximizing Constrained Submodular Functions
Shivaram Gopal, S M Ferdous, Hemanta K. Maji +1
We describe a parallel approximation algorithm for maximizing monotone submodular functions subject to hereditary constraints on distributed memory multiprocessors. Our work is mot…
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…