Year: 2025
Type: conference-paper
Abstract: We propose Orionet, efficient parallel implementations of Point-to-Point Shortest Paths (PPSP) queries using bidirectional search (BiDS) and other heuristics, with an additional focus on batch PPSP queries. We present a framework for parallel PPSP built on existing single-source shortest paths (SSSP) frameworks by incorporating novel pruning conditions. As a result, we develop efficient parallel PPSP algorithms based on early termination, bidirectional search, A* search, and bidirectional A*---all with simple and efficient implementations.
Authors: Xiaojun Dong, Andy Li, Yan Gu, Yihan Sun
Institution: University of California, Riverside
Language: English
Topic: Graph Theory and Algorithms
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Awards: CAREER: Efficient Algorithms for Modern Computer Architecture, III: Small: Rethinking the Data Organization and Lifecycle in LSM Storage Systems, G3894975505, G6671297155, CAREER: Parallel Algorithms: Theory for Practice, AF: Small: New Directions for Parallel Data Structures, NSF POSE: Phase II: Open-Source Ecosystem for OpenCilk
OpenAlex ID: W4412480902