All-Pairs Shortest Paths with Few Weights per Node
Open Access
- 15 June 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1956-1964
Abstract
No abstract availableAll Related Versions
This publication has 36 references indexed in Scilit:
- Improved bounds for rectangular monotone Min-Plus Product and applicationsInformation Processing Letters, 2023
- Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems2014
- Flow trees for vertex-capacitated networksDiscrete Applied Mathematics, 2007
- LCA Queries in Directed Acyclic GraphsLecture Notes in Computer Science, 2005
- A new proof of Szemerédi's theoremGeometric and Functional Analysis, 2001
- Computing Vertex Connectivity: New Bounds from Old TechniquesJournal of Algorithms, 2000
- On the Exponent of the All Pairs Shortest Path ProblemJournal of Computer and System Sciences, 1997
- On the All-Pairs-Shortest-Path Problem in Unweighted Undirected GraphsJournal of Computer and System Sciences, 1995
- A statistical theorem of set additionCombinatorica, 1994
- Computing dominances in EnInformation Processing Letters, 1991