arXiv (OAI Expanded)
open access
Size-Sensitive Padded Decompositions for Faster Deterministic Negative-Weight Shortest Paths
We give a deterministic algorithm for single-source shortest paths in directed graphs with integral edge weights at least $-W$ that runs in time $$O((m+n\log\log n)\log^2 n \log(nW)).$$ This improves the previous fastest deterministic bound of Li by a factor of $\log n$.
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
- Random independent sets and local sparsity#927922
- Admittance Matrix Concentration Inequalities for Understanding Uncertain Power Networks#684005
- Nonnegative DAG Learning via Concomitant Estimation#1128858
- Multiscale Renormalization of Weighted Networks#1142884
- Complex Networks Sparsification and Backbone Extraction#213247
Record · ID 1084376
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