5 papers
Weighted Matching in a Poly-Streaming Model
Ahammed Ullah, S. M. Ferdous, Alex Pothen
We introduce the poly-streaming model, a generalization of streaming models of computation in which processors process data streams containing a total of items. The alg…
Semi-Streaming Algorithms for Hypergraph Matching
Henrik Reinstädtler, S M Ferdous, Alex Pothen +2
We propose two one-pass streaming algorithms for the -hard hypergraph matching problem. The first algorithm stores a small subset of potential matching edges in a sta…
QAOA Parameter Transferability for Maximum Independent Set using Graph Attention Networks
Hanjing Xu, Xiaoyuan Liu, Alex Pothen +1
The quantum approximate optimization algorithm (QAOA) is one of the promising variational approaches of quantum computing to solve combinatorial optimization problems. In QAOA, var…
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…
SGS-GNN: A Supervised Graph Sparsification method for Graph Neural Networks
Siddhartha Shankar Das, Naheed Anjum Arafat, Muftiqur Rahman +3
We propose SGS-GNN, a novel supervised graph sparsifier that learns the sampling probability distribution of edges and samples sparse subgraphs of a user-specified size to reduce t…