A mean-time comparison of algorithms for the all-pairs shortest-path problem with arbitrary arc lengths

DOI10.1002/NET.3230080203zbMath0371.94051OpenAlexW2146277434WikidataQ115150493 ScholiaQ115150493MaRDI QIDQ4149678

Averill M. Law, W. David Kelton

Publication date: 1978

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230080203

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Software, source code, etc. for problems pertaining to combinatorics (05-04) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Related Items (2)

On the dispersion matrix of variance estimators of the sample mean in the analysis of simulation output ⋮ Analysis of initial transient deletion for replicated steady-state simulations

Cites Work

• The art and theory of dynamic programming

This page was built for publication: A mean-time comparison of algorithms for the all-pairs shortest-path problem with arbitrary arc lengths