An introduction to parallel dynamic programming
From MaRDI portal
Publication:6560205
Cites work
- A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time O(n^2 \log ^2 n)
- A note on two problems in connexion with graphs
- A Note on Yen's Algorithm for Finding the Length of All Shortest Paths in N -Node Nonnegative-Distance Networks
- A Shared Memory Computer Display System
- Branch-and-Bound Methods: General Formulation and Properties
- Dynamic programming with convexity, concavity and sparsity
- Fast Parallel Computation of Polynomials Using Few Processors
- Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using ½ N 3 Additions and
- scientific article; zbMATH DE number 3650295 (Why is no real title available?)
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3174053 (Why is no real title available?)
- scientific article; zbMATH DE number 3841211 (Why is no real title available?)
- scientific article; zbMATH DE number 3958731 (Why is no real title available?)
- scientific article; zbMATH DE number 3765535 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 49715 (Why is no real title available?)
- scientific article; zbMATH DE number 53073 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 839542 (Why is no real title available?)
- Parallelism in random access machines
- Reducibility among combinatorial problems
- The art and theory of dynamic programming
Cited in
(1)
This page was built for publication: An introduction to parallel dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560205)