Back to Results
First PageMeta Content
Routing algorithms / Network theory / Search algorithms / Matching / Shortest path problem / Bellman–Ford algorithm / Shortest path tree / Path / Tree / Graph theory / Mathematics / Theoretical computer science


Document Date: 2014-12-28 09:03:00

Open Document

File Size: 530,22 KB

Share Result on Facebook

City

Shanghai / Columbus / Champaign / Urbana / Hanoi / /

Facility

Case Institute of Technology / Towers of Hanoi / Airport Expressway / /

IndustryTerm

faster algorithm / correct algorithm / identical algorithm / partial breadth-first search / generic algorithm / dynamic programming algorithm / earlier algorithm / relaxation algorithm / http /

NaturalFeature

Olentangy River / /

OperatingSystem

Atomix / /

Organization

Institute of Technology / Combat Development Department of the US Army Electronic Proving Ground / /

Person

Nils Nilsson / Marshall Dodge / Robert Bryan / Michelle Shocked / Lester Ford / Bob Tarjan / Bertram Raphael / George Dantzig / Peter Hart / Jeff Erickson / /

Position

farmer / Hey farmer / /

ProvinceOrState

Ohio / Illinois / Indiana / /

Technology

correct algorithm / earlier algorithm / faster algorithm / 3 Algorithms / 9 Algorithms / resulting algorithm / generic shortest-path algorithm / A∗ algorithm / 8 Algorithms / 2 Algorithms / SSSP algorithms / relaxation algorithm / generic algorithm / generic relaxation algorithm / modified algorithm / dynamic programming algorithm / Leyzorek-Gray-Johnson-Ladew-Meaker-Petry-Seitz algorithm / nearly identical algorithm / generic graph traversal algorithm / 1 Algorithms / shortest-path algorithm / 7 Algorithms / same algorithm / 5 Algorithms / 6 Algorithms / 4 Algorithms / /

URL

http /

SocialTag