Finding Real-Valued Single-Source Shortest Paths ino(n3) Expected Time

DOI10.1006/jagm.1998.0937zbMath0919.68053OpenAlexW1990678352MaRDI QIDQ4216148

Stavros G. Kolliopoulos, Clifford Stein

Publication date: 23 August 1999

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1998.0937

zbMATH Keywords

average-case time complexity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (3)

A new approach to all-pairs shortest paths on real-weighted graphs ⋮ Unnamed Item ⋮ Joint chance constrained shortest path problem with Copula theory

This page was built for publication: Finding Real-Valued Single-Source Shortest Paths ino(n3) Expected Time