arXiv (OAI Expanded)
open access
A Faster Undirected Single-Source Shortest Path Algorithm
The single-source shortest paths (SSSP) problem in graphs with non-negative edge weights is one of the most classic problems in algorithms. For decades, the best known running time in the comparison-addition model was the $O(m+n\log n)$ bound of Dijkstra's algorithm with Fibonacci heaps. Recently,
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
- Scaling Laws for Looped Mixture of Experts#1154576
- Scaling Laws for Looped Mixture of Experts#1136810
- Polynomial-time algorithms with huge exponent/constant#787526
- Beyond the Training Horizon: Mechanisms and Limits of Length Generalization in Looped Transformers#1117856
- A quantum lower bound for path finding in welded trees#1062598
Record · ID 1109287
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