Back to Results
First PageMeta Content
Operations research / Routing algorithms / Network flow / NP-complete problems / Bellman–Ford algorithm / Shortest path problem / Dynamic programming / Flow network / Tree / Mathematics / Theoretical computer science / Graph theory


Lecture XIV Page 1 “The shortest path between two truths in the real domain passes through the complex domain.”
Add to Reading List

Document Date: 2013-11-21 18:55:28

Open Document

File Size: 535,99 KB

Share Result on Facebook

Company

Vertex / Run Subroutine AB / Ford / Subroutine AB / /

IndustryTerm

Minimum cost path algorithms / real world applications / by-product / min-path algorithms / communication networks / elegant solution / road networks / /

Person

Jacques Salomon Hadamard / Bellman-Ford Algorithm / Nick Trefethen / Min-Cost Problems / Augustin Jean Fresnel / Cost Page / Cost Lecture / /

Position

driver / General / mathematician / /

Product

Pentax K-x Digital Camera / /

ProgrammingLanguage

Java / /

Technology

BFS algorithm / P2P / min-path algorithms / usual BFS algorithm / Minimum cost path algorithms / Java / simplified algorithm / /

SocialTag