Orionet delivers parallel PPSP algorithms using bidirectional search and A* with a query-graph abstraction for batch queries, showing 2.9-6.8x speedups over GraphIt and MBQ on 14 graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Parallel Point-to-Point Shortest Paths and Batch Queries
Orionet delivers parallel PPSP algorithms using bidirectional search and A* with a query-graph abstraction for batch queries, showing 2.9-6.8x speedups over GraphIt and MBQ on 14 graphs.