GitHub

Muzamil-Gashroo/Dijkstras-Algorithm

An interactive web application for visualizing graph algorithms, particularly Dijkstra's shortest path algorithm. src/ ├── components/ # React components │ ├── GraphCanvas.tsx # Main graph ...
IEEE

An Efficient Parallel and Adaptive Algorithm for Large-Scale Multiple Longest Common Subsequence Problems

Abstract: The Multiple Longest Common Subsequence (MLCS) Problem is to find one or more longest common subsequences from multiple (≥ 3) strings. However, as the scale of the sequences increases, the ...
IEEE

MLFMA Based on an MPI+OpenMP Hybrid Parallel Framework with MRT Strategy

Abstract: This paper presents a hybrid MPI+OpenMP parallel Multilevel Fast Multipole Algorithm (MLFMA) based on the Minimum Round Trip (MRT) strategy, aimed at addressing electromagnetic computation ...
GitHub

BMSSP (Python) — Bounded Multi-Source Shortest Path

An efficient and faithful Python implementation of the Bounded Multi-Source Shortest Path (BMSSP) algorithm, along with baselines using pure-Python Dijkstra and SciPy-accelerated Dijkstra. This ...
www.cs.cmu.edu

Parallel and Sequential Data Structures and Algorithms

Course discussion and questions are available on Ed for students in the class. This is also where the syllabus (class policies), labs, and recitation notes are kept. Class, recitation, office hour, ...