scientific article; zbMATH DE number 3302127
From MaRDI portal
Publication:5583697
Cited in
(7)- Allowable processing orders in the accelerated cascade algorithm
- On finding shortest paths in nonnegative networks
- All shortest distances in a graph. An improvement to Dantzig's inductive algorithm
- Finding the shortest paths by node combination
- CLOUD computing risk management for server-farm repair rates, consumer load cycle, server-farm repair crew count, and additional servers
- Two fast algorithms for all-pairs shortest paths
- George Dantzig's impact on the theory of computation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5583697)
