3 papers
cs.DC2026
NI-ORCA: A Parallel Algorithm for Counting the Orbits of Non-Induced Graphlets up to K4
Syed Ibtisam Tauhidi, Arindam Karmakar, Thai Son Mai +1
Counting the orbits of graphlets in a network is a vital tool for understanding the structural roles of vertices in various graph analytics tasks. While existing algorithms efficie…
cs.DC2025
On Optimizing Locality of Graph Transposition on Modern Architectures
Mohsen Koohi Esfahani, Hans Vandierendonck
This paper investigates the shared-memory Graph Transposition (GT) problem, a fundamental graph algorithm that is widely used in graph analytics and scientific computing. Previous…
cs.AR2024
Selective Parallel Loading of Large-Scale Compressed Graphs with ParaGrapher
Mohsen Koohi Esfahani, Marco D'Antonio, Syed Ibtisam Tauhidi +2
Comprehensive evaluation is one of the basis of experimental science. In High-Performance Graph Processing, a thorough evaluation of contributions becomes more achievable by suppor…