Quick Multi-Robot Motion Planning by Combining Sampling and Search (IJCAI-23)

OpenGraph is an open-source graph processing benchmarking suite written in pure C/OpenMP.

A python implementation of a graph algorithm for solving the single source shortest path problem called Delta Stepping Algorithm

Graph Processing Framework that supports || OpenMP || CAPI

Speculate and Correct Algorithm - An optimized Bellman-Ford-like algorithm

Golang SSSP library

A parallel variant of a graph algorithm (dijkstra’s algorithm) using OpenMP on a Cray machine (XE6/XK7) and performed the benchmarking for single node up to 32 processing units

Conducted a comparative analysis on scaling results for graph algorithms like single source shortest path (SSSP) algorithm using multiple runtime systems thereby reducing time to solution for graph processing with message driven runtime systems (like Charm++, HPX5), parallel boost graph library, or Graph500

Parallel Delta-Stepping SSSP algorithm with the bucket fusion technique invented by Zhang et al. (CGO 2020). Implemented in C++, using the openMP parallelization API.

Brewing GAPBS with vertex reordering and graph segmentation

Python implementation of the Sophos SSSP protocol to interface with the SAVDI daemon.

A java implementation that introduces a way to find single source shortest paths from a given node to other nodes in the graph. The program works for both directed acyclic graphs(DAGs) as well as for directed graphs that include cycles. The input is given via a pre-validated text file written by the user, which contains the number of vertexes, n…

site

Parallel implementations of Single Source Shortest Path(SSSP) algorithms on CUDA

SSSP stands for Single-Source Shortest Path. This Dijkstra algorithm is used to obtain optimal solution for SSSP problem.

CLI for nvGraph, which is a GPU-based graph analytics library written by NVIDIA, using CUDA.

Compute metrics for modeled gossip networks

This repository contains my implementations of algorithms that solve the SSSP problem in a Graph

OpenMP implementation of Graph500 suite.

Parallel implementation of Dijkstra's algorithm