Accès ouvert
2025
preprint
OpenAlex
Elaheh Hassani, Md Taufique Hussain, Ariful Azad
We present scalable distributed-memory algorithms for sparse matrix permutation, extraction, and assignment. Our methods follow an Identify-Exchange-Build (IEB) strategy where each process identifies the local nonzeros to be sent, exchanges the required data, and then builds its local submatrix from the received …
2024
conference-paper
OpenAlex
Elaheh Hassani, Md Taufique Hussain, Ariful Azad
We develop a distributed-memory parallel algorithm for performing batch updates on streaming graphs, where vertices and edges are continuously added or removed. Our algorithm leverages distributed sparse matrices as the core data structures, utilizing equivalent sparse matrix operations to execute graph updates. …
us
(code pays fourni par la source)
2023
conference-paper
OpenAlex
Elaheh Hassani, Md Taufique Hussain, Ariful Azad
Jaccard similarity between a pair of vertices in a graph measures the relative overlap among their adjacent vertices. This metric is used to estimate the strength of existing edges and predict new edges between pairs of disconnected vertices. Computing Jaccard similarity for …
us
(code pays fourni par la source)