arXiv (All)
open access
Improved Massively Parallel Shortest Path Computation
We present new algorithms for approximate shortest path computation in weighted undirected graphs within the Massively Parallel Computation (MPC) model. Specifically, we construct an $a$-approximate Single-Source Shortest Path (SSSP) oracle: Given a query consisting of a source vertex $u \in V$, the
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Improved Massively Parallel Shortest Path Computation#1318980
- Towards Dynamic Top-$k$ Simple Shortest Paths#1357259
- Approximation and Hardness Results for the Parallel-Block Construction Problem / Arivarasan Karmegam, Alexandru Popa, Lucianna Kiffer, Antonio Fernández Anta#1188461
- Faster high-accuracy multicommodity flow in dense graphs#1215758
- Terminology for Benchmarking Link-State IGP Data-Plane Route Convergence#231839
Record · ID 1341671
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive